Submission #4485655

---

Source Code Expand

#include <bits/stdc++.h>

#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = ((int)(n)-1); i >= 0; i--)
#define all(x) (x).begin(),(x).end()

using namespace std;
using ll = long long;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> P;
 
const int INF = 1e9;
//const ll INF = 1e18;
const double EPS = 1e-10;
const int MOD = 1e9+7;
const double PI = acos(-1.0);




int main()
{
	int h,w;
	cin >> h >> w;
	char c[h][w];
	int sx,sy,gx,gy;
	rep(i,h) rep(j,w){
		cin >> c[i][j];
		if(c[i][j] == 's') sx = j,sy = i;
		if(c[i][j] == 'g') gx = j,gy = i;
	}
	int x[4] = {1,0,-1,0},y[4] = {0,-1,0,1};
	queue<P> que;
	que.push(P(sx,sy)); c[sy][sx] = '#';
	while(que.size()){
		P p = que.front();
		que.pop();
		for(int i = 0; i < 4; i++){
			int nx = p.first + x[i],ny = p.second+y[i];
			if(nx < 0 || w <= nx || ny < 0 || h <= ny) continue;
			if(c[ny][nx] == '#') continue;
			que.push(P(nx,ny));
			c[ny][nx] = '#';
		}
	}
	cout << (c[gy][gx] == '#' ? "Yes" : "No") << endl;
    return 0;
}

Submission Info

Judge Result