Submission #11609536

---

Source Code Expand

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

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

int H,W;
vector<string> c;

bool seen[510][510];
void dfs(int h,int w){
    seen[h][w] = true;
    for(int dir = 0; dir < 4 ;dir++){
        int nh = h + dx[dir];
        int nw = w + dy[dir]; 
        if (nh < 0 || nh >= H || nw < 0 || nw >= W) continue;
        if (c[nh][nw] == '#') continue;
        if (seen[nh][nw]) continue;
        dfs(nh,nw);
    }
}

int main(){
    cin >> H >> W;
    c.resize(H);
    for(int h = 0;h<H;h++) cin >> c[h];
    int sh, sw, gh, gw;
    for(int h = 0; h < H;h++){
        for(int w = 0;w < W;w++){
            if (c[h][w] == 's') sh = h, sw = w;
            if (c[h][w] == 'g') gh = h, gw = w;
        }
    }
    memset(seen, 0, sizeof(seen));
    dfs(sh, sw);
    if (seen[gh][gw]) cout << "Yes" << endl;
    else cout << "No" << endl;
}

Submission Info

Judge Result