Submission #3048471

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
using namespace std;
int h, w;
char maze[555][555];
bool reached[555][555];
void search(int, int);

int main()
{
	cin >> h >> w;
	int homex = 0;
	int homey = 0;
	int fishx = 0;
	int fishy = 0;
	
	for (int i = 0; i < h; i++) {
		for (int j = 0; j < w; j++) {
			cin >> maze[i][j];
			if (maze[i][j] == 's') {
				homex = i;
				homey = j;
			}
			else if (maze[i][j] == 'g') {
				fishx = i;
				fishy = j;
			}
		}
	}

	for (int i = 0; i < h; i++) {
		for (int j = 0; j < w; j++) {
			reached[i][j] = false;
		}
	}
	

	search(homex, homey);
	if (reached[fishx][fishy] == true) {
		cout << "Yes" << endl;
	}
	else {
		cout << "No" << endl;
	}
	

}

void search(int x, int y)
{
	if (x < 0 || h <= x || y < 0 || w <= y || maze[x][y] == '#') {
		return;
	}
	if (reached[x][y])
		return;

	reached[x][y] = true;
	search(x + 1, y);
	search(x, y + 1);
	search(x - 1, y);
	search(x, y - 1);
}

Submission Info

Judge Result