Submission #7103720

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <vector>
#include <float.h>

#include <cstdio>
#include <iomanip>


using namespace std;
typedef long long ll;
#define loop(i, N) for(int i=0; i<N; ++i)

int h, w;
string a[510];
bool his[510][510];
bool can = false;

void search(int x, int y) {
	if (x<0 || x>=w || y<0 || y>=h || a[y][x]=='#') return;
	if (his[x][y]) return;
	if (a[y][x] == 'g') {
		can = true;
		return;
	}
	his[x][y] = true;

	search(x+1, y);
	search(x, y+1);
	search(x-1, y);
	search(x, y-1);
}


int main(void) {

	cin >> h >> w;
	loop(i, h) cin >> a[i];
	loop(i, h) {
		loop(j, w) {
			if (a[i][j] == 's') {
				search(i, j);
				break;
			}
		}
	}

	if (can) cout << "Yes" << endl;
	else cout << "No" << endl;
	
}

Submission Info

Judge Result