Submission #6640971

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
int vis[510][510],x,y,f,n,m,dx[5]={0,0,0,1,-1},dy[5]={0,1,-1,0,0},can[510][510];
char ch[510][510];
void dfs(int x,int y)
{
	vis[x][y]=1;
	if(ch[x][y]=='g')
	{
		f=1;return;
	}
	for(int i=1;i<=4;i++)
	{
		int xx=x+dx[i],yy=y+dy[i];
		if(xx>0&&xx<=n&&yy>0&&yy<=m&&ch[xx][yy]!='#'&&!vis[xx][yy]&&!can[xx][yy])
		{
			vis[xx][yy]=1;
			dfs(xx,yy);
			vis[xx][yy]=0;
			if(f)return;
		}
	}
	can[x][y]=1;
}
int main()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			cin>>ch[i][j];
			if(ch[i][j]=='s')
			{
				x=i;y=j;
			}
		}
	}
	dfs(x,y);
	cout<<(f?"Yes":"No");
	return 0;
} 

Submission Info

Judge Result