Submission #5307568

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
bool a[502][502],check; 
int n,m,bx,by,ex,ey; 
int dx[4]={0,0,-1,1}; 
int dy[4]={1,-1,0,0}; 
void dfs(int x,int y){
    if(check){ 
        return ;
    }
    if(ex==x&&ey==y){ 
        check=true;
        return ;
    }
    
    int xx,yy;
    for(int i=0;i<4;i++){
        xx=x+dx[i];yy=y+dy[i];
        if(a[xx][yy]){
            a[xx][yy]=false;
            dfs(xx,yy);
             
        }
    }
}
int main(){
    cin>>n>>m;
    char c;
     for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cin>>c;
            if(c!='#'){a[i][j]=true;}
            if(c=='s'){bx=i;by=j;}
            if(c=='g'){ex=i;ey=j;}
            }
        }
    a[bx][by]=false;
    dfs(bx,by); 
    if(check)cout<<"Yes";
    else cout<<"No";
    return 0;
} 

   
 

Submission Info

Judge Result