思路:
最简单的广度优先搜索(BFS),与走迷宫类似;
AC代码:
#include<stdio.h>
#define N 50
int map[N][N][N];
int fx[6]={1,-1,0,0,0,0},fy[6]={0,0,1,-1,0,0},fz[6]={0,0,0,0,1,-1};
struct{int x;int y;int z;int pre;int num;}sq[N*N*N]; /*int num 用于记录走的步数*/
int rear,front;
int A,B,C,T;
int check(int x,int y,int z)
{
int flag=1;
if(x<0||x>A-1||y<0||y>B-1||z<0||z>C-1)
flag=0;
if(map[x][y][z]==1||map[x][y][z]==-1)
flag=0;
return flag;
}
int BFS()
{
int i;
int x,y,z,num;
rear=front=0;
map[0][0][0]=-1;
sq[rear].x=0;
sq[rear].y=0;
sq[rear].z=0;
sq[rear].num=0;
sq[rear].pre=-1;
rear++;
while(front!=rear)
{
for(i=0;i<6;i++)
{
x=sq[front].x+fx[i];
y=sq[front].y+fy[i];
z=sq[front].z+fz[i];
num=sq[front].num+1;
if(check(x,y,z))
{
sq[rear].x=x;
sq[rear].y=y;
sq[rear].z=z;
sq[rear].num=num;
sq[rear].pre=front;
map[x][y][z]=-1;
rear++;
if(x==A-1&&y==B-1&&z==C-1)
{
return sq[rear-1].num;
}
}
}
front++;
}
return -1;
}
int main()
{
int K;
int i,j,k;
int t;
scanf("%d",&K);
while(K--)
{
scanf("%d%d%d%d",&A,&B,&C,&T);
for(i=0;i<A;i++)
for(j=0;j<B;j++)
for(k=0;k<C;k++)
scanf("%d",&map[i][j][k]);
if(A-1==0&&B-1==0&&C-1==0)
printf("0\n"); /*当只有一个矩阵快时,即为出口,t=0*/
else
{
t=BFS();
if(t==-1||t>T)
printf("-1\n");
else printf("%d\n",t);
}
}
return 0;
}