Submission #7473579

---

Source Code Expand

// luogu-judger-enable-o2
#include <iostream>
using namespace std;

int book[1000][1000],n,m,flag;
char a[1000][1000];

void dfs(int x,int y)
{
	int tx,ty;
	int s[4][2]={{0,1},{0,-1},{1,0},{-1,0}};
	if(a[x][y]=='g')
	   {
	   	flag=1;
	   	return;
	   }
	  
	   for(int k=0;k<4;k++)
	   {
	   	 tx=x+s[k][0];
	   	 ty=y+s[k][1];
	   	 if(tx<1||tx>n||ty<1||ty>m)
	   	      continue;
	   	 if(a[tx][ty]!='#'&&book[tx][ty]==0)
	   	 {
	   	 	book[tx][ty]=1;
	   	 	dfs(tx,ty);
		 }
	    }
	    return ;	    
 } 
 int main()
 {
 	int i,j,startx,starty;
 	cin>>n>>m;
 	cin>>startx>>starty;
 	for(i=0;i<n;i++)
 	  cin>>a[i];
 	a[startx][starty]='s';
 	dfs(startx,starty);
 	book[startx][starty]=1;
 	if(flag==1)
 	cout<<"Yes"<<endl;
 	else
 	cout<<"No"<<endl;
 	return 0;
 }

Submission Info

Judge Result