Submission #11334343

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int n,m;
char map[510][510];
bool visit[510][510];
struct adr{
	int x, y;
}star;
int x[4]={0,1,0,-1};
int y[4]={1,0,-1,0};
bool flag=false;
void dfs(adr c){
	if(map[c.x][c.y]=='g'){
		flag=true;
		cout<<"Yes";
		return;
	}
	if(flag==true){
		return;
	}
	visit[c.x][c.y]=true;
	for(int d=0;d<4;d++){
		adr z;
		z.x=c.x+x[d];
		z.y=c.y+y[d];
		if(visit[z.x][z.y]==true||z.x>n||z.x<1||z.y>m||z.y<1||map[z.x][z.y]=='#'){
			continue;
		}
		else{
			dfs(z);
		}
	}
}
int main(){
	memset(visit,false,sizeof(visit));
	cin>>n>>m;
	for(int d=1;d<=m;d++){
		for(int a=1;a<=n;a++){
			cin>>map[d][a];
			if(map[d][a]=='s'){
				star.x=d;
				star.y=a;	
			}
		}
	}
	dfs(star);
	if(flag==false){
		cout<<"No";
	}
	return 0;
}

Submission Info

Judge Result