这道题貌似大家都是用BFS写的,因为最近在练习DFS,所以就用DFS写了,虽然自己觉得已经剪枝了,但是貌似效果不是很好,还是有1000+ms,以后会用BFS再写一次的
#include<stdio.h>
#include<string.h>
int dir[6][3]={{1,0,0},{-1,0,0},{0,1,0},{0,-1,0},{0,0,1},{0,0,-1}};
int a,b,c,flag,map[51][51][51],visit[51][51][51],t;
void dfs(int x,int y,int z,int count){
int dx,dy,dz;
if(count > t || count >= flag || (a+b+c+count>x+y+z+t))
return ;
if(x == a-1 && y == b-1 && z == c-1){
flag = count;
return ;
}
for(int i = 0;i<6;i++){
dx = x + dir[i][0];
dy = y + dir[i][1];
dz = z + dir[i][2];
if(map[dx][dy][dz] != 1){
if(dx>=0 && dx<a && dy>=0 && dy<b && dz>=0 && dz<c && (visit[dx][dy][dz] == 0 || count < visit[dx][dy][dz])){
visit[dx][dy][dz] = count;
map[dx][dy][dz] = 1;
dfs(dx,dy,dz,count+1);
map[dx][dy][dz] = 0;
}
}
}
}
int main(){
int q;
scanf("%d",&q);
while(q--){
scanf("%d %d %d %d",&a,&b,&c,&t);
for(int i = 0;i<a;i++){
for(int j = 0;j<b;j++){
for(int k = 0;k<c;k++)
scanf("%d",&map[i][j][k]);
}
}
memset(visit,0,sizeof(visit));
flag = 1000;
dfs(0,0,0,0);
if(flag == 1000)
printf("-1\n");
else printf("%d\n",flag);
}
return 0;
}