Submission #420190

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
 
template<typename T1, typename T2> istream& operator>>(istream& is, pair<T1,T2>& a){ return is >> a.first >> a.second; }
template<typename T1, typename T2> ostream& operator<<(ostream& os, pair<T1,T2>& a){ return os << a.first << " "<<a.second; }
template<typename T> istream& operator>>(istream& is, vector< T >& vc){ for(int i = 0; i < vc.size(); i++) is >> vc[i]; return is; }
template<typename T> ostream& operator<<(ostream& os, vector< T >& vc){ for(int i = 0; i < vc.size(); i++) os << vc[i] << endl; return os; }
 
#define ForEach(it,c) for(__typeof (c).begin() it = (c).begin(); it != (c).end(); it++)
#define ALL(v) (v).begin(), (v).end()
#define UNQ(s) { sort(ALL(s)); (s).erase( unique( ALL(s)), (s).end());}
#define fr first
#define sc second
 
typedef pair< int , int > Pi;
typedef pair< int , Pi > Pii;
 
typedef long long int64;
const int INF = 1 << 30;

int main() {
  int H, W;
  cin >> H >> W;
  vector< string > S(H);
  cin >> S;
  Pi s, g;
  for(int i = 0; i < S.size(); i++) {
    for(int j = 0; j < S[i].size(); j++) {
      if(S[i][j] == 's') s = make_pair(j, i);
      if(S[i][j] == 'g') g = make_pair(j, i);
    }
  }

    
  bool v[500][500] = {{}};
  queue< Pi > que;
  que.push(s);
  v[s.first][s.second] = true;
  while(!que.empty()) {
    Pi p = que.front(); que.pop();
    if(p == g) {
      puts("Yes");
      exit(0);
    }
    for(int i = 0; i < 4; i++) {
      const static signed dy[] = {0, 1, 0, -1}, dx[] = {1, 0, -1, 0};
      int ny = dy[i] + p.second, nx = dx[i] + p.first;
      if(ny < 0 || ny >= H || nx < 0 || nx >= W) continue;
      if(S[ny][nx] == '#' || v[nx][ny]++) continue;
      que.push(make_pair(nx, ny));
    }
  }
  puts("No");

}

Submission Info

Judge Result