Submission #7355143

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<time.h>
using namespace std;
struct str{
	int x,y;
};
int dis[4][2]={0,1,-1,0,0,-1,1,0};
int main()
{
	int n,m;
	cin>>n>>m;
	char map[n][m];
	int vis[n][m];
	memset(vis,0,sizeof(vis));
	queue <str> que;
	str t;
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<m;j++)
		{
			cin>>map[i][j];
			if(map[i][j]=='s')
			{
				t.x =i;
				t.y=j;
			}
		}
	}
	que.push(t); 
	while(!que.empty())
	{
		t=que.front()  ;
		que.pop() ;
		if(map[t.x ][t.y ]=='g')
		{
			printf("YES");
			return 0;
		}
		for(int i=0;i<4;i++)
		{
			str a;
			a.x=t.x+dis[i][0];
			a.y=t.y+dis[i][1];
			if(a.x>=0&&a.x<n&&a.y>=0&&a.y <m&&map[a.x ][a.y ]!='#'&&vis[a.x ][a.y ]==0)
			{
				vis[a.x ][a.y ]=1;
				que.push(a); 
			}
		}
	}
	printf("NO");
	return 0;
}

Submission Info

Judge Result