Submission #6847939

---

Source Code Expand

// luogu-judger-enable-o2
#include<iostream>
#include<cstdio>
using namespace std;
int n,m,check=0;
char map[501][501];
int next[4][2]={{0,1},{1,0},{0,-1},{-1,0}};
void dfs(int,int);
int main()
{
  int i,j;
  int startx,starty;
  cin>>n>>m;
  for(i=1;i<=n;i++)
  {
    for(j=1;j<=n;j++)
    {
      cin>>map[i][j];
    }
  }
  for(i=1;i<=n;i++)
  {
    for(j=1;j<=m;j++)
    {
      if(map[i][j]=='s')
      {
        startx=i;
        starty=j;
      }
    }
  }
  dfs(startx,starty);
  if(check==1)
    cout<<"Yes"<<endl;
  if(check==0)
    cout<<"No"<<endl;
  return 0;
}
void dfs(int x,int y)
{
  int k,newx,newy;
  {
    for(k=0;k<=3;k++)
    {
      newx=x+next[k][0];
      newy=y+next[k][1];
      if(newx<=0||newx>n||newy<=0||newy>m)continue;
      if(map[newx][newy]!='#')
      {
        if(map[newx][newy]=='g')
        {
          check=1;
          return;
        }
        else
        {
          map[newx][newy]='#';
          dfs(newx,newy);
          map[newx][newy]='.';
        }
      }
    }
  }
}

Submission Info

Judge Result