Submission #960160

---

Source Code Expand

#include <iostream>
#include <queue>
#include <string>
using namespace std;
#define MAX 500
int h, w, m[MAX][MAX];
string s[MAX];
void bfs(int y, int x) {
	int nx, ny, dd[5] = { 1, 0, -1, 0, 1 };
	for (int i = 0; i < 4; ++i) {
		if ((h <= y + dd[i]) || y + dd[i] < 0) continue;
		if ((w <= x + dd[i + 1]) || x + dd[i + 1] < 0) continue;
		ny = y + dd[i];
		nx = x + dd[i + 1];
		if ((s[ny][nx] == '.' || s[ny][nx] == 'g')&& m[ny][nx] == -1) {
			m[ny][nx] = 1;
			bfs(ny, nx);
		}
	}
}

int main() {
	int sy, sx, gy, gx;
	bool flg = true;
	cin >> h >> w;
	for (int i = 0; i < h; ++i) {
		for (int j = 0; j < w; ++j) {
			m[i][j] = -1;
		}
	}
	for (int i = 0; i < h; ++i) {
		cin >> s[i];
	}
	for (sy = 0; sy < h; ++sy) {
		for (sx = 0; sx < w; ++sx) {
			if (s[sy][sx] == 's') {
				flg = false;
				break;
			}
		}
		if (!flg) break;
	}
	bfs(sy, sx);
	flg = true;
	for (gy = 0; gy < h; ++gy) {
		for (gx = 0; gx < w; ++gx) {
			if (s[gy][gx] == 'g') {
				flg = false;
				break;
			}
		}
		if (!flg) break;
	}
	if (m[gy][gx] == 1) {
		cout << "Yes" << endl;
	}
	else {
		cout << "No" << endl;
	}
	return 0;
}

Submission Info

Judge Result