Submission #7316306

---

Source Code Expand

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

int h,w;
char c[501][501];
bool d[501][501];

void dfs(int x, int y) {
  if (x<0||h<=x) return;
  if (y<0||w<=y) return;
  if (c[x][y]=='#') return;
  if (d[x][y]) return;
  d[x][y] = true;
  dfs(x+1,y);
  dfs(x,y+1);
  dfs(x-1,y);
  dfs(x,y-1);
}

int main() {
  cin>>h>>w;
  int sx,sy,gx,gy;
  rep(i,h) {
    rep(j,w) {
      cin>>c[i][j];
      if (c[i][j]=='s') sx=i, sy=j;
      if (c[i][j]=='g') gx=i, gy=j;
    }
  }
  dfs(sx, sy);
  if (d[gx][gy]) cout<<"Yes"<<endl;
  else cout<<"No"<<endl;
}

Submission Info

Judge Result