洛谷P1238 走迷宫

Description

有一个m×n格的迷宫(表示有 m 行、n 列)，其中有可走的也有不可走的，如果用 1 表示可以走，0 表示不可以走，文件读入这m×n个数据和起始点、结束点（起始点和结束点都是用两个数据来描述的，分别表示这个点的行号和列号）。现在要你编程找出所有可行的道路，要求所走的路中没有重复的点，走时只能是上下左右四个方向。如果一条路都不可行，则输出相应信息（用 −1 表示无路）。

优先顺序：左上右下。数据保证随机生成。

输入样例#1：

5 6
1 0 0 1 0 1
1 1 1 1 1 1
0 0 1 1 1 0
1 1 1 1 1 0
1 1 1 0 1 1
1 1
5 6

输出样例#1：

(1,1)->(2,1)->(2,2)->(2,3)->(2,4)->(2,5)->(3,5)->(3,4)->(3,3)->(4,3)->(4,4)->(4,5)->(5,5)->(5,6)
(1,1)->(2,1)->(2,2)->(2,3)->(2,4)->(2,5)->(3,5)->(3,4)->(4,4)->(4,5)->(5,5)->(5,6)
(1,1)->(2,1)->(2,2)->(2,3)->(2,4)->(2,5)->(3,5)->(4,5)->(5,5)->(5,6)
(1,1)->(2,1)->(2,2)->(2,3)->(2,4)->(3,4)->(3,3)->(4,3)->(4,4)->(4,5)->(5,5)->(5,6)
(1,1)->(2,1)->(2,2)->(2,3)->(2,4)->(3,4)->(3,5)->(4,5)->(5,5)->(5,6)
(1,1)->(2,1)->(2,2)->(2,3)->(2,4)->(3,4)->(4,4)->(4,5)->(5,5)->(5,6)
(1,1)->(2,1)->(2,2)->(2,3)->(3,3)->(3,4)->(2,4)->(2,5)->(3,5)->(4,5)->(5,5)->(5,6)
(1,1)->(2,1)->(2,2)->(2,3)->(3,3)->(3,4)->(3,5)->(4,5)->(5,5)->(5,6)
(1,1)->(2,1)->(2,2)->(2,3)->(3,3)->(3,4)->(4,4)->(4,5)->(5,5)->(5,6)
(1,1)->(2,1)->(2,2)->(2,3)->(3,3)->(4,3)->(4,4)->(3,4)->(2,4)->(2,5)->(3,5)->(4,5)->(5,5)->(5,6)
(1,1)->(2,1)->(2,2)->(2,3)->(3,3)->(4,3)->(4,4)->(3,4)->(3,5)->(4,5)->(5,5)->(5,6)
(1,1)->(2,1)->(2,2)->(2,3)->(3,3)->(4,3)->(4,4)->(4,5)->(5,5)->(5,6)

一道简单的DFS深搜题目，只要注意每一步的方向

dx[4]={0,-1,0,1}

dy[4]={-1,0,1,0}

就好了，建个b数组来防止同一个格走两次。

代码如下：

#include<bits/stdc++.h>
using namespace std;
int MAP[1000][1000],x,y,sx,sy,ex,ey;
short dx[5]={0,0,-1,0,1},dy[5]={0,-1,0,1,0};
bool b[1000][1000],flag;
vector<int> vx,vy;            //记录路径
void output(){
	for(int i=0;i<vx.size()-1;i++) printf("(%d,%d)->",vx[i],vy[i]);
	printf("(%d,%d)\n",vx.back(),vy.back());
}
void dfs(int nx,int ny){
	if(nx==ex&&ny==ey){
		flag=1;
		output();
	}
	for(int i=1;i<=4;i++){
		if(nx+dx[i]>0&&nx+dx[i]<=x&&ny+dy[i]>0&&ny+dy[i]<=y&&MAP[nx+dx[i]][ny+dy[i]]==1&&b[nx+dx[i]][ny+dy[i]]==0){
			vx.push_back(nx+dx[i]),vy.push_back(ny+dy[i]);
			b[nx+dx[i]][ny+dy[i]]=1;
			dfs(nx+dx[i],ny+dy[i]);
			b[nx+dx[i]][ny+dy[i]]=0;
			vx.pop_back(),vy.pop_back();
		}
	}
}
int main(){
	cin>>x>>y;
	for(int i=1;i<=x;i++)
		for(int j=1;j<=y;j++)
			cin>>MAP[i][j];
	cin>>sx>>sy>>ex>>ey;
	vx.push_back(sx),vy.push_back(sy);
	b[sx][sy]=1;            //起点标记为已走
	dfs(sx,sy);
	if(!flag) printf("-1");
}