Submission #3528785

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;


char map1[501][501];
int vis[501][501];
int dirx[]={1,-1,0,0};
int diry[]={0,0,1,-1};
int n,m;

void dfs(int nx,int ny){
	vis[nx][ny]=1;
		for(int i=0;i<4;i++){
			int x=nx+dirx[i];
			int y=ny+diry[i];
			if(nx == 0 || nx > n || ny == 0 || ny > m)
            	continue;
			if(!vis[x][y]&&map1[x][y]!='#'){
				dfs(x,y);
			}
		}
}



int main()
{
	memset(vis,0,sizeof(vis));
	
	int sx,sy,ex,ey;
	cin>>n>>m;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++){
			cin>>map1[i][j];
			if(map1[i][j]='s'){
				sx=i;sy=j;
			}
			else if(map1[i][j]='g')
			{
				ex=i;ey=j;
			}
		}
	dfs(sx,sy);
	if(vis[ex][ey]) {//能到达终点
        cout << "Yes" << endl;
        return 0;
    }
    cout << "No" << endl;//不能到达终点
	return 0;
}

Submission Info

Judge Result