Submission #11462594

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define re register
#define Maxn 100010
#define INF 10010
inline int read()
{
	char c=getchar();re ll f=1,s=0;
	while(!isdigit(c)){if(c=='-')f=-1,c=getchar();}
	while(isdigit(c)){s=s*10+c-48;c=getchar();}
	return f*s;
}
bool f,b[501][501];
int n,m,fx,fy,sx,sy;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
char c[501][501];
void r(){
	cin>>m>>n;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>c[i][j];
			if(c[i][j]=='s'){fx=i;fy=j;}
			if(c[i][j]=='g'){sx=i;sy=j;}
			if(c[i][j]=='#') b[i][j]=1;
		}
	}
}
void dfs(int x,int y){
	if(x==sx&&y==sy){f=1;cout<<"Yes"<<endl;exit(0);}
	b[x][y]=1;
	for(int i=0;i<4;i++){
		if(x+dx[i]>0&&x+dx[i]<=n&&y+dy[i]>0&&y+dy[i]<=m&&!b[x+dx[i]][y+dy[i]]) dfs(x+dx[i],y+dy[i]);
	}
	b[x][y]=0;
}
int main()
{
	r();
	dfs(fx,fy);
	cout<<"No"<<endl;
	return 0;
}

Submission Info

Judge Result