Submission #420565

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>

using namespace std;

int H, W;
string field[500];
bool reached[500][500];
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};

void dfs(int x, int y) {
	if (x < 0 || W <= x || y < 0 || H <= y || field[y][x] == '#')
		return;
	if (reached[y][x] == true)
		return;
	
	reached[y][x] = true;

	for (int i = 0; i < 4; i++) {
		dfs(x + dx[i], y + dy[i]);
	}
}

int main() {
	for (int i = 0; i < 500; i++)
		fill_n(reached[i], 500, false);
	int sx, sy, gx, gy;
	cin >> H >> W;
	for (int i = 0; i < H; i++) {
		cin >> field[i];
		for (int j = 0; j < W; j++) {
			if (field[i][j] == 's') {
				sx = j; sy = i;
			}
			if (field[i][j] == 'g') {
				gx = j; gy = i;
			}
		}
	}
	dfs(sx, sy);
	if (reached[gy][gx] == true)
		cout << "Yes" << endl;
	else
		cout << "No" << endl;
	return 0;
}

Submission Info

Judge Result