Submission #11184709

---

Source Code Expand

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

Submission Info

Judge Result