Submission #420274

---

Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define int ll
//#define endl "\n"
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
#define all(c) (c).begin(), (c).end()
#define loop(i,a,b) for(ll i=a; i<ll(b); i++)
#define rep(i,b) loop(i,0,b)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
template<class T> ostream & operator<<(ostream & os, vector<T> const &);
template<int n, class...T> typename enable_if<(n>=sizeof...(T))>::type _ot(ostream &, tuple<T...> const &){}
template<int n, class...T> typename enable_if<(n< sizeof...(T))>::type _ot(ostream & os, tuple<T...> const & t){ os << (n==0?"":" ") << get<n>(t); _ot<n+1>(os, t); }
template<class...T> ostream & operator<<(ostream & os, tuple<T...> const & t){ _ot<0>(os, t); return os; }
template<class T, class U> ostream & operator<<(ostream & os, pair<T,U> const & p){ return os << "(" << p.first << ", " << p.second << ") "; }
template<class T> ostream & operator<<(ostream & os, vector<T> const & v){ rep(i,v.size()) os << v[i] << (i+1==(int)v.size()?"":" "); return os; }
template<class T> inline bool chmax(T & x, T const & y){ return x<y ? x=y,true : false; }
template<class T> inline bool chmin(T & x, T const & y){ return x>y ? x=y,true : false; }
#ifdef DEBUG
#define dump(...) (cerr<<#__VA_ARGS__<<" = "<<mt(__VA_ARGS__)<<" ["<<__LINE__<<"]"<<endl)
#else
#define dump(...)
#endif
// ll const mod = 1000000007;
// ll const inf = 1LL<<60;

int H,W;
char g[600][600];
bool vis[600][600];

bool dfs(int ci, int cj){
    vis[ci][cj] = true;
    if(g[ci][cj]=='g') return true;
    int di[] = {0,1,0,-1};
    int dj[] = {1,0,-1,0};
    rep(i,4){
        int ni = ci+di[i], nj = cj+dj[i];
        if(ni >= H || nj >= W || ni < 0 || nj < 0) continue;
        if(g[ni][nj] == '#' || vis[ni][nj]) continue;
        if(dfs(ni,nj)) return true;
    }
    return false;
}

signed main(){
    cin >> H >> W;
    rep(i,H) cin >> g[i];
    int si,sj;
    rep(i,H)rep(j,W){
        if(g[i][j]=='s') si = i, sj = j;
    }
    puts(dfs(si,sj) ? "Yes" : "No");
}

Submission Info

Judge Result