Submission #7339733

---

Source Code Expand

#include<iostream>
using namespace std;
int a[510][510],n,m,f,sx,sy,ex,ey;
char k;
int fx[4]={-1,1,0,0};
int fy[4]={0,0,1,-1};
void dfs(int x,int y)
{
	if(x<1||y<1||x>n||y>m)
	return;
	a[x][y]=1;
	if(x==ex&&y==ey)
	f=1;
	for(int i=0;i<4;i++)
	{
		int xx=x+fx[i];
		int yy=y+fy[i];
		if(a[xx][yy]==0)
		dfs(xx,yy);
	}
}
int main()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	for(int j=1;j<=m;j++)
	{
		cin>>k;
		if(k=='s')
		{
			sx=i;
			sy=j;
		}
		if(k=='g')
		{
			ex=i;
			ey=j;
		}
		if(k=='.')
		a[i][j]=0;
		if(k=='#')
		a[i][j]=1;
	}
	dfs(sx,sy);
	if(f)
	cout<<"Yes"<<endl;
	else
	cout<<"No"<<endl;
}

Submission Info

Judge Result