Submission #7498400

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
int a[510][510];
bool dfs(int x,int y,int m,int n){
	if(x==m&&y==y)return true;
	a[x][y]=false;
	if(a[x+1][y]) dfs(x+1,y,m,n);
	if(a[x-1][y]) dfs(x-1,y,m,n);
	if(a[x][y+1]) dfs(x,y+1,m,n);
	if(a[x][y-1]) dfs(x,y-1,m,n);
} 
int main(){
	int m,n,bx,by,wx,wy;
	cin>>m>>n;
	for(int i=1;i<=m;i++)
	for(int j=1;j<=n;j++){
		char c;
		cin>>c;
		if(c=='.')a[i][j]=1;
		if(c=='s'){
			bx=i;by=j;
		}
		if(c=='g'){
			a[i][j]=1;
			wx=i;wy=j;
		}
	}
	if(dfs(bx,by,wx,wy))cout<<"Yes";
	else cout<<"No";
	return 0; 
}

Submission Info

Judge Result