Submission #6743530

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int n,m;
bool c[550][550],vis[550][550];
int startx,starty,endx,endy;

bool in(int x,int y)
{
	return ((x>=0) && (y>=0) && (x<n) && (y<m) && (vis[x][y]==0));
}

void dfs(int x,int y)
{
	vis[x][y]=1;
	if(in(x+1,y) && c[x+1][y]) dfs(x+1,y);
	if(in(x-1,y) && c[x-1][y]) dfs(x-1,y);
	if(in(x,y+1) && c[x][y+1]) dfs(x,y+1);
	if(in(x,y-1) && c[x][y-1]) dfs(x,y-1);
}

int main()
{
	char ch;
	cin>>n>>m;
	for(int i=0;i<n;i++)
		for(int j=0;j<m;j++)
		{
			char ch=getchar();
			while(ch!='s' && ch!='g' && ch!='.' && ch!='#') ch=getchar();//不读\n 
			if(ch=='#') c[i][j]=0;
			else c[i][j]=1;
			if(ch=='s')
			{
				startx=i;
				starty=j;
			}
			if(ch=='g')
			{
				endx=i;
				endy=j;
			}
		}
	memset(vis,0,sizeof(vis));
	dfs(startx,starty);
	if(vis[endx][endy]) cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
	return 0;
 } 

Submission Info

Judge Result