HDU 1253 简单的三维BFS

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;

int a,b,c,t;
int graph[55][55][55];
bool vis[55][55][55];
int dx[] = {1,-1,0,0,0,0};
int dy[] = {0,0,1,-1,0,0};
int dz[] = {0,0,0,0,1,-1};

struct node{
    int x,y,z,step;
};

void bfs(){
    node cur,next;
    cur.x = 0;
    cur.y = 0;
    cur.z = 0;
    cur.step = 0;
    vis[0][0][0] = 1;
    queue<node> q;
    q.push(cur);
    while(!q.empty()){
        cur = q.front();
        q.pop();
        for(int i=0;i<6;i++){
            next = cur;
            next.x += dx[i];
            next.y += dy[i];
            next.z += dz[i];
            if(cur.x==a-1 && cur.y==b-1 && cur.z==c-1 && cur.step<=t){
                printf("%d\n",cur.step);
                return ;
            }
            if(next.x>=0 && next.x<a && next.y>=0 && next.y<b && next.z>=0 && next.z<c && !vis[next.x][next.y][next.z] && graph[next.x][next.y][next.z]==0 && cur.step<=t){
                vis[next.x][next.y][next.z] = 1;
                next.step = cur.step+1;
                q.push(next);
            }
        }
    }
    printf("-1\n");
}

int main(){
    int T;
    scanf("%d",&T);
    while(T--){
        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",&graph[i][j][k]);
                }
            }
        }
        memset(vis,false,sizeof(vis));
        bfs();
    }
    return 0;
}