hdu1253胜利大逃亡（城堡的怪物太狠，主角难免天天逃亡）

题目链接：http://icpc.njust.edu.cn/Problem/Hdu/1253/

其实就是二维扩展到三维了，增加了搜索方向，其他的没什么不同。

代码如下：

 #include<bits/stdc++.h>
 using namespace std;
 typedef unsigned int ui;
 typedef long long ll;
 typedef unsigned long long ull;
 #define pf printf
 #define mem(a,b) memset(a,b,sizeof(a))
 #define prime1 1e9+7
 #define prime2 1e9+9
 #define pi 3.14159265
 #define lson l,mid,rt<<1
 #define rson mid+1,r,rt<<1|1
 #define scand(x) scanf("%llf",&x)
 #define f(i,a,b) for(int i=a;i<=b;i++)
 #define scan(a) scanf("%d",&a)
 #define dbg(args) cout<<#args<<":"<<args<<endl;
 #define inf 0x3f3f3f3f
 #define maxn 55
 int a,b,c,t,k;
 int dir[][]={{,,},{-,,},{,,},{,-,},{,,},{,,-}};
 int Map[maxn][maxn][maxn];
 bool vis[maxn][maxn][maxn];
 struct node{
     int x,y,z,step;
 };
 node cur,nxt;
 bool ok(node& q)
 {
     return q.x>=&&q.x<=a&&q.y>=&&q.y<=b&&q.z>=&&q.z<=c&&Map[q.x][q.y][q.z]==&&!vis[q.x][q.y][q.z];
 }
 int bfs()
 {
     queue<node>q;
     node st;
     st.x=st.y=st.z=;
     st.step=;
     vis[][][]=;
     q.push(st);
     while(!q.empty())
     {
         cur=q.front();
         q.pop();
         if(cur.x==a&&cur.y==b&&cur.z==c&&cur.step<=k)
         {
             return cur.step;
         }
         f(i,,)
         {
             nxt=cur;
             nxt.x+=dir[i][];
             nxt.y+=dir[i][];
             nxt.z+=dir[i][];
             nxt.step++;
             if(!ok(nxt))continue;
             vis[nxt.x][nxt.y][nxt.z]=;
 //            cout<<nxt.step<<" x:"<<nxt.x<<" y:"<<nxt.y<<" z:"<<nxt.z<<endl;
             q.push(nxt);
         }
     }
     return -;
 }
 int main()
 {
     //freopen("input.txt","r",stdin);
     //freopen("output.txt","w",stdout);
     std::ios::sync_with_stdio(false);
     scan(t);
     while(t--)
     {
         scanf("%d%d%d%d",&a,&b,&c,&k);
         f(i,,a)
             f(j,,b)
                 f(k,,c)
                 {
                     scan(Map[i][j][k]);
                 }
                 mem(vis,false);
             pf("%d\n",bfs());
     }
  }