Submission #1674581

---

Source Code Expand

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

const int MAX = 500;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
	int H, W;
	cin >> H >> W;
	char c[MAX + 2][MAX + 2];
	for (int i = 0;i <= W + 1;i ++) {
		c[0][i] = '#';
		c[H + 1][i] = '#';
	}
	for (int i = 1;i <= H;i ++) {
		c[i][0] = '#';
		cin >> (c[i]+1);
		c[i][W + 1] = '#';
	}
	queue<pair<int, int> > que;
	for (int i = 0;i <= H + 1;i ++) for (int j = 0;j <= W + 1;j ++) if (c[i][j] == 's') que.push(make_pair(i, j));
	
	pair<int, int> p;
	while(!que.empty()) {
		p = que.front();
		que.pop();
		if (c[p.first][p.second] == 'g') {
			cout << "Yes";
			return 0;
		} else if (c[p.first][p.second] == '#') continue;
		c[p.first][p.second] = '#';
		for (int i = 0;i < 4;i ++) {
			if (c[p.first + dy[i]][p.second + dx[i]] != '#') {
				que.push(make_pair(p.first + dy[i], p.second + dx[i]));
			}
		}
	}
	cout << "No";
	return 0;
}

Submission Info

Judge Result