Submission #420215

---

Source Code Expand

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cassert>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
#include <cassert>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
bool u[1005][1005];
string f[1005];
int h,w;
bool ok = 0;
void dfs(int x,int y)
{
	if(u[x][y]) return ; u[x][y]=1;
	if(f[x][y] == 'g') ok = 1;
	int dx[4]={0,1,0,-1};
	int dy[4]={1,0,-1,0};
	for(int i=0;i<4;i++)
	{
		int nx = x+dx[i];
		int ny = y+dy[i];
		if(nx<0 || nx>=h) continue;
		if(ny<0 || ny>=w) continue;
		if(f[nx][ny] == '#') continue;
		dfs(nx,ny);
	}
}
int main()
{
	cin >> h >> w;
	for(int i=0;i<h;i++) cin >> f[i];
	for(int i=0;i<h;i++) for(int j=0;j<w;j++)
	{
		if(f[i][j] == 's')
		{
			dfs(i,j);
		}
	}
	cout << (ok?"Yes":"No") << endl;
}

Submission Info

Judge Result