Submission #3054865

---

Source Code Expand

#define _USE_MATH_DEFINES
#include <iostream>
#include <stdlib.h>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <functional>
#include <string>
#include <string.h>
#include <math.h>
#include <map>

using namespace std;

void Search(char src[500][500], int x, int y, int h, int w, bool dst[500][500]){
	if (x < 0 || y < 0 || x >= w || y >= h || src[x][y] == '#')
		return;

	if (dst[x][y])
		return;

	dst[x][y] = true;

	Search(src, x + 1, y, h, w, dst);
	Search(src, x, y + 1, h, w, dst);
	Search(src, x - 1, y, h, w, dst);
	Search(src, x, y - 1, h, w, dst);
}

int main(){
	int H, W, gh, gw;
	char c[500][500] = {};
	bool isreached[500][500] = {};

	cin >> H >> W;

	for (int h = 0; h < H; ++h){
		for (int w = 0; w < W; ++w){
			cin >> c[h][w];
			if (c[h][w] == 'g'){
				gh = h;
				gw = w;
			}
		}
	}

	for (int h = 0; h < H; ++h){
		for (int w = 0; w < W; ++w){
			if (c[h][w] == 's'){
				Search(c, h, w, H, W, isreached);
				break;
			}
		}
	}

	if (isreached[gh][gw])
		cout << "Yes" << endl;
	else
		cout << "No" << endl;

	return 0;
}

Submission Info

Judge Result