Submission #9885278

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int> >;
#define rep(i, n)         for(int i = 0; i < (int)(n); i++)
#define brep(n)           for(int bit=0;bit<(1<<n);bit++)
#define erep(i,container) for (auto i : container)
#define irep(i, n)        for(int i = n-1; i >= (int)0; i--)
#define rrep(i,m,n) for(int i = m; i < (int)(n); i++)
#define reprep(i,j,h,w) rep(i,h)rep(j,w)
#define all(x) (x).begin(),(x).end()
#define aall(x,n) (x).begin(),(x).begin()+(n)
#define VEC(type,name,n) std::vector<type> name(n);rep(i,n)std::cin >> name[i];
#define pb push_back
#define pf push_front
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define mp make_pair
#define sum accumulate
#define keta fixed<<setprecision
#define vvector(name,typ,m,n,a)vector<vector<typ> > name(m,vector<typ> (n,a))
#define vvvector(name,t,l,m,n,a) vector<vector<vector<t> > > name(l, vector<vector<t> >(m, vector<t>(n,a)));
#define vvvvector(name,t,k,l,m,n,a) vector<vector<vector<vector<t> > > > name(k,vector<vector<vector<t> > >(l, vector<vector<t> >(m, vector<t>(n,a)) ));
typedef long long ll;
const int INF = 2000000000;
const ll INF64 = 1000000000000000ll;
const ll MOD = 1000000007LL;
int main(){
    int h,w;
    std::cin >> h>>w;
    vvector(a,char,h,w,'a');
    int sx,sy;
    reprep(i,j,h,w){
        std::cin >> a[i][j];
        if(a[i][j]=='s'){
            sx=j;sy=i;
        }
    }
    
    int dx[]={-1,0,1,0,-1};
    std::queue<pair<int,int>> q;
    q.push(mp(sy,sx));
    bool ans=0;
    while(!q.empty()){
        int x,y;
        y=q.front().fi;
        x=q.front().se;
        if(a[y][x]=='#'){
            q.pop();continue;
        }
        rep(i,4){
            if(y+dx[i]>=0&&y+dx[i]<h&&x+dx[i+1]>=0&&x+dx[i+1]<w){
            //    std::cout << y+dx[i]<<x+dx[i+1] << std::endl;
                if(a[y+dx[i]][x+dx[i+1]]=='g'){
                    std::cout << "Yes" << std::endl;
                    exit(0);
                }
                if(a[y+dx[i]][x+dx[i+1]]=='.')q.push(mp(y+dx[i],x+dx[i+1]));
            }
            
        }
        a[y][x]='#';
        q.pop();
    }
    
     std::cout << "No" << std::endl;
    
}

Submission Info

Judge Result