Submission #7200760

---

Source Code Expand

#include<iostream>
using namespace std;
bool a[1000][1000];
int sx,sy;
int gx,gy;
int movex[4]={-1,1,0,0};
int movey[4]={0,0,-1,1};
int nx,ny;

void dfs(int x,int y)
{
     if(nx==gx&&ny==gy)
    {  
        a[gx][gy]=false;
        return;
    }

    for(int i=0;i<4;i++)
    {
        nx=x+movex[i];
        ny=y+movey[i];
        if(a[nx][ny])
        {
            a[x][y]=false;
            dfs(nx,ny);
            // a[x][y]=true;
        }
    }   
}

int main()
{
    int n,m;
    char c;
    cin>>n>>m;
    for(int i=0;i<n;i++)
        for(int j=0;j<m;j++)
        {
            cin>>c;
            if(c=='.')
            a[i+1][j+1]=true;
            if(c=='s')
            {
                sx=i+1;
                sy=j+1;
            }
            if(c=='g')
            {
                gx=i+1;
                gy=j+1; 
            }           
        }
    a[gx][gy]=true;
    dfs(sx,sy);
    
    if(a[gx][gy]==true)
    cout<<"No"<<endl;
    else cout<<"Yes"<<endl;
    return 0;

}

Submission Info

Judge Result