Submission #7138956

---

Source Code Expand

// luogu-judger-enable-o2
#include <iostream>
using namespace std;
int n,m;
int x,y;
int xx,yy;
char a[510][510];
int v[510][510];
int dx[4]={-1,1,0,0};
int dy[4]={0,0,-1,1}; 
int flag=0;
void dfs(int i,int j){
	if(i==xx&&j==yy){
		cout<<"Yes"<<endl;
		flag=1;
		return;
	}
	for(int s=0;s<=3;s++)
		if(!v[i+dx[s]][j+dy[s]]&&i+dx[s]<=n&&i+dx[s]>=1&&j+dy[s]<=m&&dy[s]+j>=1)
		{
		if(flag)return;
		v[i+dx[s]][j+dy[s]]=true;	
		dfs(i+dx[s],j+dy[s]);
		v[i+dx[s]][j+dy[s]]=false;
	}
}
int main(){
	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')x=i,y=j,v[i][j]=1;
		if(a[i][j]=='g')xx=i,yy=j;
		if(a[i][j]=='#')v[i][j]=1;
	}
	dfs(x,y);
	if(!flag)
	cout<<"No"<<endl;
	return 0;
} 

Submission Info

Judge Result