胜利大逃亡hdu

#include<queue>
#include<cstdio>
#include<cstring>
using namespace std;
int a,b,c,t;
int dt[50][50][50];
int vis[50][50][50]; 
struct node{
	int x;int y;int z;
	int step;
};
int main(){
	int dd[6][3]={{1,0,0},{-1,0,0},{0,1,0},{0,-1,0},{0,0,1},{0,0,-1}};
	int T;
	scanf("%d",&T);
	while(T--){
		scanf("%d%d%d%d",&a,&b,&c,&t);
		int i,j,k;
		for(i=0;i<a;i++){
			for(j=0;j<b;j++){
				for(k=0;k<c;k++){
					scanf("%d",&dt[i][j][k]);
				}
			}
		}
		node w={0,0,0,0};
		vis[0][0][0]=1;
		queue<node>q;
		q.push(w);
		int ans=-1;
		while(!q.empty() ){
			node now,net;
			now=q.front() ;
			q.pop() ;
			if(now.x ==a-1&&now.y ==b-1&&now.z ==c-1) {
				ans=now.step ;
				break;
			}
			if(now.step>t) break;
			int dx,dy,dz;
			for(i=0;i<6;i++){
				dx=now.x+dd[i][0];
				dy=now.y+dd[i][1];
				dz=now.z+dd[i][2];
				if(dx<0||dy<0||dz<0||dx>=a||dy>=b||dz>=c||vis[dx][dy][dz]||dt[dx][dy][dz]) continue;
				net={dx,dy,dz,now.step+1};
				q.push(net); 
				vis[dx][dy][dz]=1; 
			}
		}
		printf("%d\n",ans); 
		memset(vis,0,sizeof(vis));
} 		
} 

嗯嗯 一次AC 的快乐~