Submission #10763319

---

Source Code Expand

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

int main() {
  int h,w; cin >> h >> w;
  char c[h][w];
  P s;
  REP(i,h) REP(j,w) {
    cin >> c[i][j];
    if(c[i][j] == 's') s={i,j};
  }

  vector<P> moves = { {0,1},{0,-1},{1,0},{-1,0} };
  queue<P> q;
  q.push(s);
  while(!q.empty()) {
    P t = q.front(); q.pop();
    if (c[t.first][t.second] == 'g') { cout << "Yes" << endl; return 0; }
    if (c[t.first][t.second] == '#') continue;
    if (c[t.first][t.second] == 'v') continue;
    c[t.first][t.second] = 'v'; // visited

    for(P m : moves) {
      int y = t.first + m.first, x = t.second + m.second;
      if (y >= 0 && y < h && x >= 0 && x < w) q.push(make_pair(y,x));
    }
  }
  cout << "No" << endl;
  return 0;
}

Submission Info

Judge Result