HDU 1253 - 胜利大逃亡

 1 #include <iostream>
 2 #include <cstring>
 3 #include <queue>
 4 using namespace std;
 5 struct pr{
 6     int x,y,z,t;
 7  };
 8  const int x[10]={0,0,0,1,-1,0,0},y[10]={0,1,-1,0,0,0,0},z[10]={0,0,0,0,0,1,-1};
 9  int map[111][111][111];//读取 
10  int flag[111][111][111];//标记 
11  int a,b,c,death;
12  
13  queue<pr> s;
14  pr q,temp;
15  
16  void bfs()
17  {
18     while(!s.empty())//每次清零！ 
19     s.pop();
20     memset(flag,0,sizeof(flag));//开始初始化 
21     flag[1][1][1]=1;
22     q.x=1;q.y=1; q.z=1; q.t=0; 
23     s.push(q);
24     while(!s.empty())
25     {
26         q=s.front();
27         s.pop();
28         for(int i=1;i<=6;i++)
29             if(q.x+x[i]>0&&q.x+x[i]<=a&&
30                q.y+y[i]>0&&q.y+y[i]<=b&&
31                q.z+z[i]>0&&q.z+z[i]<=c)
32                 {
33                 if(map[q.x+x[i]][q.y+y[i]][q.z+z[i]]!=1)
34                     if(!flag[q.x+x[i]][q.y+y[i]][q.z+z[i]])
35                     {
36                         
37                         temp.x=q.x+x[i];
38                         temp.y=q.y+y[i];
39                         temp.z=q.z+z[i];
40                         temp.t=q.t+1;
41                         flag[temp.x][temp.y][temp.z]=1;
42                         if(temp.t>=death)
43                         {
44                             printf("-1\n");
45                             return ;
46                         }
47                         if(temp.x==a&&temp.y==b&&temp.z==c)
48                         {
49                             printf("%d\n",temp.t);
50                             return;
51                         }
52                         s.push(temp);
53                     }
54                 }
55     }
56     printf("-1\n");
57  }
58 int main()
59 {
60     int i,j,k,T;
61     cin>>T;
62     while(T--)
63     {
64         cin>>a>>b>>c>>death;
65         for(i=1;i<=a;i++)
66             for(j=1;j<=b;j++)
67                 for(k=1;k<=c;k++){
68                     scanf("%d",&map[i][j][k]);//cin者死。 
69                 }
70         bfs();
71     }return 0;
72 }