Submission #3560076

---

Source Code Expand

#include<iostream>
#include<cstdio>
using namespace std;

int n, m, sx, sy, ex, ey;
char a[510][510];
int vis[510][510];
int nextx[4] = {0, 0, 1, -1};
int nexty[4] = {1, -1, 0, 0};

void dfs(int x, int y) {
	vis[x][y] = 1;
	int tx, ty;
	for(int i = 0; i < 4; i++) {
		tx = x + nextx[i];
		ty = y + nexty[i];
		if(x == 0 || x > n || y == 0 || y > m) {
			continue;
		}
		if(!vis[tx][ty] && a[tx][ty] != '#') {
			dfs(tx, ty);
		}
	}
}

int main() {
	cin >> n >> m;
	int i, j;
	for(i = 1; i <= n; i++) {
		for(j = 1; j <= m; j++) {
			cin >> a[i][j];
		}
		if(a[i][j] == 's') {
			sx = i;
			sy = j;
		}
		if(a[i][j] == 'g') {
			ex = i;
			ey = j;	
		}
	}
	dfs(sx, sy);
	if(!vis[ex][ey]) {
		cout << "No" << endl;
		return 0;
	}
	cout << "Yes" << endl;
	return 0;
}

Submission Info

Judge Result