Submission #10065383

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,-1,0,1};

int main(){
    int h,w;
    cin >> h >> w;
    vector<string> c(h);
    rep(i,h) cin >> c[i];
    queue<pair<int,int>> s;
    //vector<vector<bool>> check(h,vector<bool>(w,false));

    //int cnt = 0;

    bool red=false;

    //cout << "error1" << endl;
    

    rep(i,h) rep(j,w){
        if(c[i][j]=='s'){
            c[i][j] = '#';
            s.push(make_pair(i,j));
        }
    }

    //cout << "error2" << endl;

    while(!s.empty()){

        //cout << "error3" << endl;
        rep(i,4){
            //if(cnt>=100000000) goto SKIP;
            int nx = s.front().first + dx[i];
            int ny = s.front().second + dy[i];
            //cout << "nx=" << nx << " ny=" << ny << endl;

            if(nx>=0 && nx<h && ny>=0 && ny<w && (c[nx][ny] == '.' || c[nx][ny]=='g')){
                if(c[nx][ny]=='g'){
                    //cout << "goodwell" << endl;
                    red = true;
                    goto SKIP;
                }
                c[nx][ny] = '#';
                s.push(make_pair(nx,ny));
            }
        }
        //cout << "error4" << endl;
        s.pop();
    }
    //cout << "error5" << endl;

    
    SKIP:
    if(red) cout << "Yes" << endl;
    else cout << "No" << endl;

    /*rep(i,h){
        cout << c[i] << endl;
    }*/
}

Submission Info

Judge Result