Submission #7370091

---

Source Code Expand

#include<iostream>
#include<algorithm>
using namespace std;
struct node{
	long long x,y,s;
}que[1000001];
long long n,m,a[10001][10001],book[10001][10001];
long long x1,y1,x2,y2,tx,ty;
char s[10001][10001];

int main(){
	long long next[4][2]={{0,1},{1,0},{0,-1},{-1,0}};
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>s[i][j];
			if(s[i][j]=='s'){
				a[i][j]=0;
				x1=i;
				y1=j;
			}
			else if(s[i][j]=='#'){
				a[i][j]=1;
			}
			else if(s[i][j]=='g'){
				a[i][j]=0;
				x2=i;
				y2=j;
			}
			else{
				a[i][j]=0; 
			}
		}
	}
	long long head=1,tail=1;
	long long f=0;
	que[tail].x=x1;
	que[tail].y=y1;
	tail++;
	book[x1][y1]=1;
	while(head<tail){
		for(int k=0;k<=3;k++){
			tx=que[head].x+next[k][0];
			ty=que[head].y+next[k][1];
			if(tx<1||tx>n||ty<1||ty>m) continue;
			if(a[tx][ty]==0&&book[tx][ty]==0){
				book[tx][ty]=1;
				que[tail].x=tx;
				que[tail].y=ty;
				tail++;
			}
			if(tx==x2&&ty==y2){
				cout<<"Yes\n";
				return 0;
			}
		}
		head++;
	}
	cout<<"No\n";
	return 0;
	
}

Submission Info

Judge Result