Submission #420208

---

Source Code Expand

#include <iostream>
#include <queue>

using namespace std;

struct P {
	int x, y;
};

int main() {
	int sx, sy, gx, gy;
	int m[500][500];
	int H, W; cin >> H >> W;
	for (int y = 0; y < H; ++y) {
		string str; cin >> str;
		for (int x = 0; x < W; ++x) {
			switch (str[x]) {
				case 's': m[y][x] = 0; sx = x, sy = y; break;
				case 'g': m[y][x] = 0; gx = x, gy = y; break;
				case '.': m[y][x] = 0; break;
				case '#': m[y][x] = 1; break;
			}
		}
	}
	bool gone[500][500] = {0};
	queue<P> Q; Q.push( (P){sx, sy} );
	while ( !Q.empty() ) {
		P p = Q.front(); Q.pop();
		int x = p.x, y = p.y;
		if (x < 0 || x >= W || y < 0 || y >= H) continue;
		if (m[y][x]) continue;
		if (gone[y][x]) continue;
		gone[y][x] = true;

		Q.push( (P){x+1, y} );
		Q.push( (P){x-1, y} );
		Q.push( (P){x, y+1} );
		Q.push( (P){x, y-1} );
	}
	if (gone[gy][gx]) {
		cout << "Yes" << endl;
	}
	else {
		cout << "No" << endl;
	}
}

Submission Info

Judge Result