Submission #7103412

---

Source Code Expand

// luogu-judger-enable-o2
#include<bits/stdc++.h>
#define N 101
using namespace std;

char ch;
int n,m,x,y,a,b;
bool flag;
int vis[N][N];
int sp[4][2]={{0,1},{0,-1},{1,0},{-1,0}};

void dfs(int x,int y)
{
    for(int i=0;i<4;i++)
    {
        int nx=x+sp[i][0];
        int ny=y+sp[i][1];
        if(nx>=0&&nx<n&&ny>=0&&ny<n&&vis[nx][ny]==0)
        {
            vis[nx][ny]=1;
            if(nx==a&&ny==b)
            {
                cout<<"YES"<<endl;
                flag=true;
                return;
            }
            else
                dfs(nx,ny);
        }
    }
}
int main()
{
        memset(vis,0,sizeof(vis));
        flag=false;
        cin>>n>>m;
        
        for(int i=0;i<n;i++)
            for(int j=0;j<m;j++)
            {
                cin>>ch;
                if(ch=='#')
                    vis[i][j]=1;
                    else if(ch=='s')
                    {
                    	x=i;y=j;
					}
					else if(ch=='g') 
					{
						a=i;b=j;
					}
            }
            
        if(vis[x][y]||vis[a][b])
        {
            cout<<"NO"<<endl;
        }
        else
            dfs(x,y);
        if(!flag)
            cout<<"NO"<<endl;
            
    return 0;
}

Submission Info

Judge Result