Submission #7584674

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
int a[520][520];
const int Movex[] = {0, 0, 1, -1};
const int Movey[] = {1, -1, 0, 0};
bool b[520][520];
int start_x, start_y, end_x, end_y;
inline void dfs(int x, int y, int n, int m)
{
	int t_x, t_y;
	b[x][y] = false;
	for(int i=0;i<4;i++)
	{
		t_x = x + Movex[i];
		t_y = y + Movey[i];
		if(x == 0 || x > n || y == 0 || y > m)continue;        
		if(b[t_x][t_y] && a[t_x][t_y] != '#')dfs(t_x, t_y, n, m);
	}
}
int main()
{
	int n, m;
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)	
		{
			cin>>a[i][j];
			if(a[i][j] == 's'){
				start_x = i;
				start_y = j;
			}
			if(a[i][j] == 'g'){
				end_x = i;
				end_y = j;
			}
		}
	}
	b[start_x][start_y] = false;
	dfs(start_x, start_y, n, m);
	if(!b[end_x][end_y])cout<<"Yes";
	else cout<<"No";
	return 0;
}

Submission Info

Judge Result