Submission #10351751

---

Source Code Expand

#include <iostream>
#include <cstdlib>

using namespace std;

const int MAXN = 1001;
int m,n;
char field[MAXN][MAXN];

int dx[] = {1,-1,0,0};
int dy[] = {0,0,1,-1};
int color[MAXN][MAXN];

void dfs(int x,int y){
	for(int k = 0;k < 4;++k){
		int xx = dx[k]+x;
		int yy = dy[k]+y;
		if(xx > 0 && xx <= m && yy > 0 && yy <= n){
			if(field[xx][yy] != '#'&& field[xx][yy] == '.' && color[xx][yy] == 0){
				color[xx][yy] = 1;
				dfs(xx,yy);
			}
			if(field[xx][yy] == 'g'){
				cout<<"Yes"<<endl;
				exit(1);
			}
		}
	}
}

int main(){
	cin>>m>>n;
	int x,y;
	for(int i = 1;i <= m;i++){
		for(int j = 1;j <= n;j++){
			cin>>field[i][j];
			if(field[i][j] == 's'){
				x = i;y = j;
			}
		}
	}
	
	dfs(x,y);
	cout<<"No"<<endl;
	
	return 0;
}

Submission Info

Judge Result