Submission #7618592

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
const int Movey[4] = {1, -1, 0, 0};
const int Movex[4] = {0, 0, 1, -1};
char l[520][520];
bool b[520][520];
int n, m, sx, sy, ex, ey;
inline void dfs(int x, int y)
{
	b[x][y] = false;
	int px, py;
	for(int i=0;i<4;i++)
	{
		px =  x + Movex[i];
		py = x + Movey[i];
		if(x == 0 || x>n || y==0 || y>m)
		{
			continue;
		}
		if(b[px][py] && l[px][py]!='#')dfs(px, py);
	}
}
int main()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			cin>>l[i][j];
			if(l[i][j]=='s')sx = i;sy = j;
			if(l[i][j]=='g')ex = i; ex = j;
		}
	}
	dfs(sx, sy);
	if(!b[ex][ey])cout<<"Yes"<<endl;return 0;
	cout<<"No"<<endl;return 0;
}

Submission Info

Judge Result