Submission #5235675

---

Source Code Expand

#include<bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
int n,k,a[501][501],h[501][501],xs,ys,xe,ye;
char b;
void dfs(int x,int y){
    if(x==xe&&y==ye){cout<<"Yes";exit(0);}
    if(h[x+1][y]==0&&a[x+1][y]==1){
        h[x+1][y]=1;
        dfs(x+1,y);
    }
    if(h[x-1][y]==0&&a[x-1][y]==1){
        h[x-1][y]=1;
        dfs(x-1,y);
    }
    if(h[x][y+1]==0&&a[x][y+1]==1){
        h[x][y+1]=1;
        dfs(x,y+1);
    }
    if(h[x][y-1]==0&&a[x][y-1]==1){
        h[x][y-1]=1;
        dfs(x,y-1);
    }	
    
}
int main(){
    cin>>n>>k;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=k;j++){
            cin>>b;
            if(b=='s'){xs=i;ys=j;a[i][j]=1;h[i][j]=1;}
            if(b=='g'){xe=i;ye=j;a[i][j]=1;}
            if(b=='.'){a[i][j]=1;}
            if(k=='#') a[i][j]=0;
        }
    dfs(xs,ys);
    cout<<"No";
    return 0;
}

Submission Info

Judge Result