Submission #420204

---

Source Code Expand

#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };

ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};

bool dfs(int y, int x, int H, int W, vector<string>& c) {
	if (c[y][x] == 'g') return true;
	c[y][x] = '#';
	for (int k = 0; k < 4; k++) {
		int _y = y + dy[k], _x = x + dx[k];
		if (_y >= 0 && _y < H && _x >= 0 && _x < W && c[_y][_x] != '#')
			if (dfs(_y, _x, H, W, c))
				return true;
	}
	return false;
}

int main() {
	int H, W; cin >> H >> W;
	vector<string> c(H);
	int ys, xs;
	for (int y = 0; y < H; y++) {
		cin >> c[y];
		for (int x = 0; x < W; x++)
			if (c[y][x] == 's') ys = y, xs = x;
	}
	cout << (dfs(ys, xs, H, W, c) ? "Yes" : "No") << endl;
}

Submission Info

Judge Result