Submission #6752568

---

Source Code Expand

#include <iostream>
using namespace std;
	char s[600][600];
	int n,m;
	int stx,sty;
	bool flag=1;
void dfs(int x,int y){
		if(x<1||y<1||x>n||y>m)	return ;
		
		if(s[x+1][y]!='#'&&s[x+1][y]!='!'){
			s[x+1][y]='!';
			dfs(x+1,y);
		}
		
		if(s[x-1][y]!='#'&&s[x-1][y]!='!'){
			s[x-1][y]='!';
			dfs(x-1,y);
		}
		
		if(s[x][y+1]!='#'&&s[x][y+1]!='!'){
			s[x][y+1]='!';
			dfs(x,y+1);
		}
		
		if(s[x][y-1]!='#'&&s[x][y-1]!='!'){
			s[x][y-1]='!';
			dfs(x,y-1);
		}
	}//将s点能走过的地方标记。如果能走到g。则g就要='!'; 
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++){
			cin>>s[i][j];
	if(s[i][j]=='s'){
		stx=i;
		sty=j;
	}
	}
	dfs(stx,sty);
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			if(s[i][j]=='g')
				flag=0;
				
	if(flag)
	cout<<"Yes";
	else
	cout<<"No";
	return 0;
} 

Submission Info

Judge Result