同样还是之前做的题目,经典的深搜
最少步数
时间限制:
3000 ms | 内存限制:
65535 KB
难度:
4
-
描述
-
这有一个迷宫,有0~8行和0~8列:
1,1,1,1,1,1,1,1,1
1,0,0,1,0,0,1,0,1
1,0,0,1,1,0,0,0,1
1,0,1,0,1,1,0,1,1
1,0,0,0,0,1,0,0,1
1,1,0,1,0,1,0,0,1
1,1,0,1,0,1,0,0,1
1,1,0,1,0,0,0,0,1
1,1,1,1,1,1,1,1,10表示道路,1表示墙。
现在输入一个道路的坐标作为起点,再如输入一个道路的坐标作为终点,问最少走几步才能从起点到达终点?
(注:一步是指从一坐标点走到其上下左右相邻坐标点,如:从(3,1)到(4,1)。)
-
输入
-
第一行输入一个整数n(0<n<=100),表示有n组测试数据;
随后n行,每行有四个整数a,b,c,d(0<=a,b,c,d<=8)分别表示起点的行、列,终点的行、列。
输出
- 输出最少走几步。 样例输入
-
2 3 1 5 7 3 1 6 7
样例输出
-
12 11
-
第一行输入一个整数n(0<n<=100),表示有n组测试数据;
#include <stdio.h>
#include <stdlib.h>
int may[9][9] =
{
{1,1,1,1,1,1,1,1,1},
{1,0,0,1,0,0,1,0,1},
{1,0,0,1,1,0,0,0,1},
{1,0,1,0,1,1,0,1,1},
{1,0,0,0,0,1,0,0,1},
{1,1,0,1,0,1,0,0,1},
{1,1,0,1,0,1,0,0,1},
{1,1,0,1,0,0,0,0,1},
{1,1,1,1,1,1,1,1,1}
};
int min = 100;
int LastL, LastR;
void fun(int FirstL, int FirstR, int L) //更新最小步数
{
if(FirstL == LastL && FirstR == LastR)
{
if(L<min)
{
min = L;
}
}
else
{
if(may[FirstL-1][FirstR] == 0)
{
may[FirstL-1][FirstR] = 1;
fun(FirstL-1, FirstR, L+1);
may[FirstL-1][FirstR] = 0; //记得取消标记,因为找最小的需要回溯
}
if(may[FirstL+1][FirstR] == 0)
{
may[FirstL+1][FirstR] = 1;
fun(FirstL+1, FirstR, L+1);
may[FirstL+1][FirstR] = 0;
}
if(may[FirstL][FirstR-1] == 0)
{
may[FirstL][FirstR-1] = 1;
fun(FirstL, FirstR-1, L+1);
may[FirstL][FirstR-1] = 0;
}
if(may[FirstL][FirstR+1] == 0)
{
may[FirstL][FirstR+1] = 1;
fun(FirstL, FirstR+1, L+1);
may[FirstL][FirstR+1] = 0;
}
}
return;
}
int main()
{
int n;
scanf("%d", &n);
while( n-- )
{
min = 100;
int FirstL, FirstR;
scanf("%d%d%d%d", &FirstL, &FirstR, &LastL, &LastR);
fun(FirstL, FirstR, 0);
printf("%d\n", min);
}
return 0;
}
最优代码
#include<cstdio>
#define min(x,y) x>y?y:x
int maze[9][9]={1,1,1,1,1,1,1,1,1,
1,0,0,1,0,0,1,0,1,
1,0,0,1,1,0,0,0,1,
1,0,1,0,1,1,0,1,1,
1,0,0,0,0,1,0,0,1,
1,1,0,1,0,1,0,0,1,
1,1,0,1,0,1,0,0,1,
1,1,0,1,0,0,0,0,1,
1,1,1,1,1,1,1,1,1};
int a,b,c,d,m;
void dfs(int x,int y,int s){
if(maze[x][y]) return;
if(x==c&&y==d){
m=min(s,m);
return;
}
s++;
maze[x][y]=1;
dfs(x+1,y,s);
dfs(x,y+1,s);
dfs(x-1,y,s);
dfs(x,y-1,s);
maze[x][y]=0;
}
int main(){
int n;
scanf("%d",&n);
while(n--){
m=9999;
scanf("%d%d%d%d",&a,&b,&c,&d);
dfs(a,b,0);
printf("%d\n",m);
}
return 0;
}