Submission #420183

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
int dy[]={-1,0,1,0};
int dx[]={0,1,0,-1};
bool visited[1000][1000];
char t[1000][1000];
int h,w;
int si,sj;

bool dfs(int y,int x){
  if(y<0||x<0)return false;
  if(y>=h||x>=w)return false;
  if(t[y][x]=='#')return false;
  if(visited[y][x])return false;
  if(t[y][x]=='g')return true;
  visited[y][x]=true;
  for(int i=0;i<4;i++){
    int ny=y+dy[i];
    int nx=x+dx[i];
    if( dfs(ny,nx) )return true;
  }
  return false;
}
int main(){
  cin>>h>>w;
  for(int i=0;i<h;i++)
    for(int j=0;j<w;j++){
      cin>>t[i][j];
      if(t[i][j]=='s'){
        si=i,sj=j;
      }
    }
  if(dfs(si,sj))cout<<"Yes"<<endl;
  else cout<<"No"<<endl;
  return 0;
}

Submission Info

Judge Result