Submission #6902760

---

Source Code Expand

#include<iostream>
using namespace std;
char a[501][501];
bool ok,visit[501][501];
int n,m;
void dfs(int x,int y) {
	if(x==0||y==0||visit[x][y]||x>n||y>m||a[x][y]=='#'||ok){
		return;
	}
	if(a[x][y]=='g') {
		cout<<"Yes";
		ok=true;
		return;
	}
	visit[x][y]=true;
	dfs(x+1,y);
	dfs(x-1,y);
	dfs(x,y+1);
	dfs(x,y-1);
	visit[x][y]=false;
	return;
}
int main() {
	cin>>n>>m;
	int x,y;
	for(int i=1 ; i<=n ; i++) {
		for(int j=1 ; j<=m ; j++) {
			cin>>a[i][j];
			if(a[i][j]=='s') {
				x=i;
				y=j;
			}
		}
	}
	dfs(x,y);
	if(!ok) {
		cout<<"No";
		return 0; 
	}
	return 0;
}

Submission Info

Judge Result