Submission #3605027

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
int dx[4]={0,0,-1,1};
int dy[4]={1,-1,0,0};
int n,m,xx,yy,x1,p=0,x2;
char s[1000][1000];
void dfs(int a,int b){
	if(a==x1&&b==x2){
		p=1;
		cout<<"Yes";
	}
	for(int i=0;i<4;i++){
		int x=a+dx[i];
		int y=b+dy[i];
		if(x>0&&y>0&&x<=n&&y<=m&&s[x][y]!='#'){
			s[x][y]='#';
			dfs(x,y);
		}
	}
}
int main(){
	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'){
				xx=i;
				yy=j;
				s[i][j]='#';
			}
			if(s[i][j]=='g'){
				x1=i;
				x2=j;
			} 
		}
	}
	dfs(xx,yy);
	if(p==0)cout<<"No";
}

Submission Info

Judge Result