Submission #4781988

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define int long long
#define double long double
#define mod 1000000007
#define F first
#define S second
#define P pair<long long,long long>
#define all(a) a.begin(),a.end()
#define INF 1000000000000000000
#define PI (3.141592653589793)
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
using namespace std;

int n,m,sx,sy;
char maze[510][510];
bool done[510][510]={false};
bool ans=false;

void dfs(int x, int y){
    if(x<0 or y<0 or x>=n or y>=m or maze[x][y]=='#') return;
    if(done[x][y]) return;
    done[x][y]=true;
    if(maze[x][y]=='g'){
        ans=true;
        return;
    }
    rep(i,4){
        dfs(x+dx[i], y+dy[i]);
    }
}

signed main(){
    cin>>n>>m;
    rep(i,n){
        rep(j,m){
            cin>>maze[i][j];
            if(maze[i][j]=='s'){
                sx=i; sy=j;
            }
        }
    }
    dfs(sx,sy);
    cout<<(ans?"Yes":"No")<<endl;
}

Submission Info

Judge Result