Submission #11419867

---

Source Code Expand

#include <algorithm>
#include<iostream>
#include<stdio.h>
#include <algorithm>
#include<iostream>
#include<stdio.h>
#include<vector>
#include<set>
#include<string>
#include<iomanip>
#include<queue>
#include<functional>
#include<cmath>
#define rep(i,n) for(int i=0; i<(int)n; i++)//n回繰り返す
using namespace std;
using ll = long long;
using P = pair<int, int>;
using graph = vector<vector<int>>;

char c[600][600]; int H,W;
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
bool reached[600][600] = { false };
void dfs(int h, int w);
int main() {
	 int sh, sw,gh,gw; cin >> H >> W;
	rep(i, H) {
		rep(j, W) {
			cin >> c[i][j];
			if (c[i][j] == 's') {
				sh = i;
				sw = j;
			}
			if (c[i][j] == 'g') {
				gh = i;
				gw = j;
			}

		}
	}
	dfs(sh, sw);
	if (reached[gh][gw]) {
		cout << "Yes" << endl;
	}
	else {
		cout << "No" << endl;
	}
}
void dfs(int h, int w) {
	if (h < 0 || H <= h || w<0 || w>=W)return;
	if (reached[h][w] == true)return;
	reached[h][w] = true;
	if (c[h][w] == '#')return;
	rep(i, 4) {
		int nh = h + dx[i];
		int nw = w + dy[i];
		dfs(nh, nw);
	}
	
	
}



































    

Submission Info

Judge Result