Submission #3786491

---

Source Code Expand

#include<iostream>
#include<queue>
#include<cstdlib>
#include<cstdio>
using namespace std;
struct ss{int x;int y;};
queue<ss>q;
int m,n;
int map_[520][520];
int xx[]={-1,1,0,0};
int yy[]={0,0,-1,1};
int vis[520][520];
int main()
{
	cin>>m>>n;ss b;
	for(int i=1;i<=m;i++)
	{
		for(int j=1;j<=n;j++)
		{
			map_[i][j]=getchar();
			if(map_[i][j]=='\n')
			{
				map_[i][j]=getchar();
			}
			if(map_[i][j]=='s') {b.x=i;b.y=j;}
		}
	}
	q.push(b);
	while(!q.empty())
	{
		ss p=q.front();
		q.pop();
		
		for(int i=0;i<4;i++)
		{
			if(p.x+xx[i]>=1&&p.x+xx[i]<=m&&p.y+yy[i]>=1&&p.y+yy[i]<=n&&map_[p.x+xx[i]][p.y+yy[i]]!='#'&&!vis[p.x+xx[i]][p.y+yy[i]])
			{if(map_[p.x+xx[i]][p.y+yy[i]]=='g') 
		{
			cout<<"Yes"<<endl;
			exit(0);
		}
				ss m;
				m.x=p.x+xx[i];
				m.y=p.y+yy[i];
				vis[m.x][m.y]=1;
				q.push(m); 
			}
		}
	}
	cout<<"No"<<endl;
	return 0;
	
}

Submission Info

Judge Result