HDU 1253 胜利大逃亡

很简单的三维深搜。

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define N 60
int map[N][N][N];
int m,n,k,time,ok;
int a1,b1,c1,a2,b2,c2;
int dir[6][3]={{1,0,0},{-1,0,0},{0,1,0},{0,-1,0},{0,0,1},{0,0,-1}};
struct node
{
    int x;
    int y;
    int z;
    int step;
}queue[N*N*N];
int bfs()
{
    struct node now,pre;
    int e=0,h=1;
    queue[0].x=a1;
    queue[0].y=b1;
    queue[0].z=c1;
    queue[0].step=0;
    while(e<h)
    {
        pre=queue[e];
        if(pre.x==a2&&pre.y==b2&&pre.z==c2)
        {
            ok=1;
            return pre.step;
        }
        for(int i=0;i<6;i++)
        {
            now.x=pre.x+dir[i][0];
            now.y=pre.y+dir[i][1];
            now.z=pre.z+dir[i][2];
            now.step=pre.step+1;
            if(now.x>=0&&now.x<m&&now.y>=0&&now.y<n&&now.z>=0&&now.z<k&&!map[now.x][now.y][now.z])
            {
                map[now.x][now.y][now.z]=1;
                queue[h++]=now;
            }
        }
        e++;
    }
    return -1;
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d%d%d",&m,&n,&k,&time);
        int i,j,l;
        ok=0;
        for(i=0;i<m;i++)
        {
            for(j=0;j<n;j++)
            {
                for(l=0;l<k;l++)
                {
                    scanf("%d",&map[i][j][l]);
                }
            }
        }
        a1=0;
        b1=0;
        c1=0;
        a2=m-1;
        b2=n-1;
        c2=k-1;
        int o=bfs();
        if(ok&&o<=time)
        {
            printf("%d\n",o);
        }
        else
        {
            printf("-1\n");
        }
    }
    return 0;
}