Submission #7104266

---

Source Code Expand

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

int H,W;
bool seen[510][510];
char f[510][510];

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

void dfs(int h,int w){
  seen[h][w]=true;
  for (int dir=0;dir<4;dir++){
    int nh=h+dx[dir];
    int nw=w+dy[dir];
    if (nh<0||nh>H-1||nw<0||nw>W-1){
      continue;
    }
    else if (f[nh][nw]=='#'){
      continue;
    }
    else if (seen[nh][nw]){
      continue;
    }
    dfs(nh,nw);
  }
}
 
int main() {
  cin >> H >> W;
  for (int i=0;i<H;i++){
    for (int j=0;j<W;j++){
      cin >> f[i][j];
      seen[i][j]=false;
    }
  }
  int sh,sw,gh,gw;
  for (int h=0;h<H;h++){
    for (int w=0;w<W;w++){
      if (f[h][w]=='s'){
        sh=h,sw=w;
      }
      else if (f[h][w]=='g'){
        gh=h,gw=w;
      }
    }
  }
  dfs(sh,sw);
  if (seen[gh][gw]){
    cout << "Yes" << endl;
  }
  else {
    cout << "No" << endl;
  }
}

Submission Info

Judge Result