60分dfs求调
查看原帖
60分dfs求调
765990
ultimate_regular楼主2023/7/23 18:11
#include <bits/stdc++.h>
using namespace std;
int ans=0;
int ey,ex,fx,fy,sx,sy,n,m,t;
int mymap[105][105];
bool vis[105][105];
int _x[]={0,-1,0,1};
int _y[]={-1,0,1,0};
void dfs(int x,int y)
{
	if(x==ex&&y==ey){
		return ;
	}
	for(int i=0;i<4;i++){
		int dx=x+_x[i];
		int dy=y+_y[i];
		if(dx>0&&dx<=n&&dy>0&&dy<=m&&vis[dx][dy]==0&&mymap[dx][dy]!=1)
		{
			vis[dx][dy]=1;
			dfs(dx,dy);
			vis[dx][dy]=0;
		}
	}
}
int main()
{
	cin>>n>>m>>t;
	cin>>sx>>sy>>ex>>ey;
	while(t--){
	    int ax,ay;
	    cin>>ax>>ay;
	    mymap[ax][ay]=1;
	}
    vis[sx][sy]=1;
	dfs(sx,sy);
    if(dfs)
        cout<<"Yes";
    else
        cout<<"No";
	return 0;
}
2023/7/23 18:11
加载中...