Submission #11616882

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int h, w;
vector<string> c;
vector<vector<bool>> seen;
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};

bool dfs(int x, int y){
    if(seen[x][y]) return false;
    seen[x][y] = true;
    if(c[x][y] == '#') return false;
    if(c[x][y] == 'g') return true;

    bool res = false;
    for (auto i = 0; i < 4; i++) {
        int x_tmp = x + dx[i];
        int y_tmp = y + dy[i];
        if(0 > x_tmp or x_tmp > h - 1 or 0 > y_tmp or y_tmp > w - 1) continue;
        // res |= dfs(x_tmp, y_tmp);
        if(dfs(x_tmp, y_tmp)) return true;
    }
    return false;
}

int main(){
    cin >> h >> w;
    c.resize(h);
    seen.resize(h, vector<bool>(w, false));
    int x = 0, y = 0;
    for (auto i = 0; i < h; i++) {
        cin >> c[i];
        if(string::size_type pos = c[i].find('s') != string::basic_string::npos) {
            x = i;
            y = pos - 1;
        }
    }

    cout << (dfs(x, y) ? "Yes" : "No") << endl;
    return 0;
}

Submission Info

Judge Result