Submission #11592692

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; i++)
using namespace std;
using Field = vector<string>;
int dh[4] = {1, 0, -1, 0};
int dw[4] = {0, 1, 0, -1};
int H; int W;
Field S;
int res = 0;

void dfs(vector<vector<bool>> &seen, int h, int w) {
    seen[h][w] = true;
    rep(i, 4) {
        int nh = h + dh[i];
        int nw = w + dw[i];


        if(nh >= H || nh < 0 || nw >= W || nw < 0) continue;
        if(seen[nh][nw] == true) continue;
        if(S[nh][nw] == '#') continue;
        if(S[nh][nw] == 'g') {
            S[nh][nw] = true;
            break;
        }
        // S[nh][nw] = 1;
        dfs(seen, nh, nw);
    }

}
int main() {

    cin >> H >> W;
    //field
    S.resize(H);
    rep(i, H) {
        cin >> S[i];
    }
    int sh; int sw; int gh; int gw;

    rep(i, H) {
        rep(j, W){
            if (S[i][j] == 's') {
                sh = i;
                sw = j;
            }
            if (S[i][j] == 'g') {
                gh = i;
                gw = j;
            }
        }
    }
    vector<vector<bool>> seen(H, vector<bool>(W, 0));
    dfs(seen, sh, sw);
    if(S[gh][gw] == true) cout << "Yes" << endl;
    else cout << "No" << endl;


    return 0;
}

Submission Info

Judge Result