Submission #761063

---

Source Code Expand

#include<iostream>
#include<iomanip>
#include<map>
#include<vector>
#include<string>
#include<stack>
using namespace std;

enum {
	WALL = 0,
	ROAD = 1,
	SEARCHED = 2,
	GOAL = 3
};

int main() {
	int H, W;
	cin >> H >> W;
	int state[502][502] = { 0 };
	stack<pair<int, int>> place;

	for (int i = 1; i <= H; i++) {
		string s;
		cin >> s;
		for (int j = 1; j <= s.length(); j++) {
			switch (s[j]) {
			case 's':
				state[i][j] = SEARCHED;
				place.push(make_pair(i, j));
				break;
			case 'g':
				state[i][j] = GOAL;
				break;
			case '.':
				state[i][j] = ROAD;
				break;
			case '#':
				state[i][j] = WALL;
				break;
			}
		}
	}

	const int xy[5] = { 0, 1, 0, -1, 0 };

	while (1 <= place.size()) {
		auto p = place.top();
		place.pop();
		state[p.first][p.second] = SEARCHED;

		for (int i = 0; i < 4; i++) {
			const int y = p.first + xy[i];
			const int x = p.second + xy[i + 1];
			switch (state[y][x]) {
			case GOAL:
				cout << "Yes" << endl;
				return 0;
			case ROAD:
				place.push(make_pair(y, x));
				break;
			}
		}
	}
	cout << "No" << endl;
}

Submission Info

Judge Result