Submission #10303930

---

Source Code Expand

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

typedef long long ll;

int main() {
    int H, W, si, sj, gi, gj;
    cin >> H >> W;
    vector<string> c(H);
    rep(i, H) {
        cin >> c[i];
        rep(j, W) {
            if (c[i][j] == 's') {
                si = i;
                sj = j;
            }
            if (c[i][j] == 'g') {
                gi = i;
                gj = j;
            }
        }
    }
    queue<pair<int, int>> q;
    q.push(make_pair(si, sj));
    while (q.size() > 0) {
        auto p = q.front();
        q.pop();
        int i = p.first, j = p.second;
        if (c[i][j] == '#') continue;
        c[i][j] = '#';
        int di[4] = {1, 0, -1, 0}, dj[4] = {0, 1, 0, -1};
        rep(k, 4) {
            int ni = i + di[k], nj = j + dj[k];
            if (ni < 0 || ni >= H || nj < 0 || nj >= W) continue;
            if (c[ni][nj] == 'g') {
                cout << "Yes\n";
                return 0;
            }
            if (c[ni][nj] == '.') q.push(make_pair(ni, nj));
        }
    }
    cout << "No\n";
}

Submission Info

Judge Result