dfs模版求助
查看原帖
dfs模版求助
1048589
HuangBarry楼主2024/8/15 09:26

样例全过 #6开错

#include<bits/stdc++.h>
#define endl '\n'
#define Made return 0
#define by
#define Barry
using namespace std;
int n,m;
bool vis[555][555];
char Map[555][555];
int dx[]={0,0,-1,1};
int dy[]={1,-1,0,0};
inline void dfs(int x,int y){
	if(Map[x][y]=='g'){
		cout<<"Yes"<<endl;
		exit(0);
	}
	for(int i=0;i<4;i++){
		int nx=x+dx[i];
		int ny=y+dy[i];
		if(nx<1||ny<1||nx>n||ny>m||vis[nx][ny]||Map[nx][ny]=='#')
			continue;
		vis[nx][ny]=1;
		dfs(nx,ny);
		vis[nx][ny]=0;
	}
}
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			cin>>Map[i][j];
	vis[1][1]=1;
	dfs(1,1);
	cout<<"No"<<endl;
	Made by Barry;
}

2024/8/15 09:26
加载中...