Submission #6049332

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <functional>
#include <string>
#include <climits>
#include <vector>
#include <numeric>
#include <complex>
#include <map>
#include <bitset>
#include <stack>
#include <queue>
#include <set>
using namespace std;
    
#define __int64 long long
#define long __int64
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
const int Vec = 4;
const int Vecy[Vec] = {0,-1,0,1};
const int Vecx[Vec] = {1,0,-1,0};
const int Modd = 1000000007;


char c[501][501];

queue<pair<int, int>> que;

int main(){
    int h,w;
    cin >> h >> w;

    rep(iy,h){
        rep(ix, w){
            cin >> c[iy][ix];
            if(c[iy][ix] == 's'){
                que.push(make_pair(ix, iy));
            }
        }
    }

    while(!que.empty()){
        auto loc = que.front();
        que.pop();

        for(int veci=0; veci<Vec; veci++){
            int cx = loc.first + Vecx[veci];
            int cy = loc.second + Vecy[veci];

            if(cx < 0 || cx >= w || cy < 0 || cy >= h) continue;
            if(c[cy][cx] == 'g'){
                cout << "Yes" << endl;
                return 0;
            }
            if(c[cy][cx] == '.'){
                c[cy][cx] = '#';
                que.push(make_pair(cx, cy));
            }
        }
    }

    cout << "No" << endl;
    return 0;
}

Submission Info

Judge Result