Submission #7128546

---

Source Code Expand

#include<iostream>
#include<vector>
#include<string>
#include<cstring>

#define rep(i, n) for(int i; i<(n); i++);
typedef long long ll;
using namespace std;

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

int H, W;
vector<string> field;
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(field[nh][nw] == '#') continue;

        if(seen[nh][nw]) continue;

        dfs(nh, nw);
    }
}

int main(){
    cin >> H >> W;
    field.resize(H);
    for(int h = 0; h<H; h++) cin >> field[h];

    int sh, sw, gh, gw;

    for(int h=0; h<H; h++){
        for(int w=0; w<W; w++){
            if(field[h][w] == 's') sh=h, sw=w;
            if(field[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;

    return 0;
}

Submission Info

Judge Result