胜利大逃亡

http://acm.hdu.edu.cn/showproblem.php?pid=1253

#include<stdio.h>
#include<iostream>
using namespace std ;
#include<queue>
const int INF=10000 ;
const int MAX=70 ;
int a, b, c, t ;
struct node
{
    int x, y, z ;
    int time ;
} ;

int dir[6][3]={{0,0,1},{0,0,-1},{0,1,0},{0,-1,0},{1,0,0},{-1,0,0}} ;
int map[MAX][MAX][MAX] ;
int curtime[MAX][MAX][MAX] ;
int bfs(node s)
{
    int i ;
    queue<node>Q ;
    Q.push(s) ;
    node head ;
    while(!Q.empty())
    {
        head = Q.front() ;
        Q.pop() ;
       for(i=0; i<6; i++)
       {
         int x = head.x + dir[i][0] ;
         int y = head.y + dir[i][1] ;
         int z = head.z + dir[i][2] ;
         if(x>=0&&x<=a-1&&y>=0&&y<=b-1&&z>=0&&z<=c-1&&map[x][y][z]!=1)
         {
            node t ;
            t.x = x ;
            t.y = y ;
            t.z = z ;
            t.time = head.time + 1 ;
            if(t.time<curtime[x][y][z])
            {
                curtime[x][y][z] = t.time ;
                Q.push(t) ;
            }
         }
      }
   }
   return curtime[a-1][b-1][c-1] ;
}
int main()
{
    int k ;
    node start ;
    scanf("%d", &k) ;
    while(k--)
    {
        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]) ;
            curtime[i][j][k] = INF ;
        }
        start.x = start.y = start.z = start.time = 0 ;
        curtime[0][0][0] = 0 ;
        int mintime = bfs(start) ;
        if(mintime<t)
        printf("%d\n",mintime) ;
        else
        printf("-1\n") ;
    }
    return 0 ;
}