Submission #7575643

---

Source Code Expand

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

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


bool seen[510][510];
void dfs(Graph &G, int h, int w){
  seen[h][w] = true;
  for(int i = 0; i < 4; i++){
    int nh = h + dx[i];
    int nw = w + dy[i];
    if(nh>= H || nh < 0 || nw >= W || nw < 0) continue;
    if(seen[nh][nw]) continue;
    if(G[nh][nw] == '#') continue;
    dfs(G, nh, nw);
  }
}

int main(){
  cin >> H >> W;
  Graph map;
  map.assign(H, vector<char>(W));
  int sh, sw, gh, gw;
  
  rep(h,H)rep(w,W){
    char a;
    cin >> a;
    map[h][w] = a;
    if(a == 's'){
      sh = h, sw = w;
    }
    if(a == 'g'){
      gh = h, gw = w;
    }
  }
  
  dfs(map, sh, sw);
  if(seen[gh][gw]) cout << "Yes" << endl;
  else cout << "No" << endl;
  return 0;
}

Submission Info

Judge Result