Submission #6896734

---

Source Code Expand

#include <iostream>

using namespace std;

char a[501][501];
bool v[501][501];
bool suc = 0;
const int dx[] = { 1, -1, 0, 0 };
const int dy[] = { 0, 0, 1, -1 };
int n, m;

void dfs(int x, int y) {
	if (a[x][y] == 'g') {
		suc = 1;
		return;
	}
	if (v[x][y]) {
		return;
	}
	v[x][y] = 1;
	for(int i = 0; i < 4; ++i) {
		int tx = x + dx[i], ty = y + dy[i];
		if (tx < 1 || tx > n || ty < 1 || ty > m) continue;
		if (a[tx][ty] == '#') continue;
		dfs(tx, ty);
		if (suc) return;
	}
}

int main() {
	int sx, sy;
	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') {
				sx = i, sy = j;
			}
		}
	}
	dfs(sx, sy);
	cout << (suc ? "Yes" : "No") << endl;
	return 0;
}

Submission Info

Judge Result