1 3 3 4 20 0 1 1 1 0 0 1 1 0 1 1 1 1 1 1 1 1 0 0 1 0 1 1 1 0 0 0 0 0 1 1 0 0 1 1 0
11
解题：bfs无疑
1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <cmath> 5 #include <algorithm> 6 #include <climits> 7 #include <vector> 8 #include <queue> 9 #include <cstdlib> 10 #include <string> 11 #include <set> 12 #include <stack> 13 #define LL long long 14 #define pii pair<int,int> 15 #define INF 0x3f3f3f3f 16 using namespace std; 17 const int dir[6][3] = {0,0,-1,0,0,1,0,-1,0,0,1,0,-1,0,0,1,0,0}; 18 struct node { 19 int x,y,z,step; 20 node(int a = 0,int b = 0,int c = 0,int d = 0) { 21 x = a; 22 y = b; 23 z = c; 24 step = d; 25 } 26 }; 27 bool mp[60][60][60],vis[60][60][60]; 28 int A,B,C,T; 29 node q[500000]; 30 int head,tail; 31 int bfs() { 32 int i,j,k,x,y,z; 33 node temp(1,1,1,0); 34 head = tail = 0; 35 q[tail++] = temp; 36 vis[temp.x][temp.y][temp.z] = true; 37 while(head < tail) { 38 node now = q[head++]; 39 if(now.x == A && now.y == B && now.z == C) 40 return now.step; 41 for(int i = 0; i < 6; i++) { 42 x = now.x+dir[i][0]; 43 y = now.y+dir[i][1]; 44 z = now.z+dir[i][2]; 45 if(!mp[x][y][z] && !vis[x][y][z]) { 46 vis[x][y][z] = true; 47 q[tail++] = node(x,y,z,now.step+1); 48 } 49 } 50 } 51 return -1; 52 } 53 int main() { 54 int t,i,j,k,tmp; 55 scanf("%d",&t); 56 while(t--) { 57 scanf("%d %d %d %d",&A,&B,&C,&T); 58 memset(vis,false,sizeof(vis)); 59 memset(mp,true,sizeof(mp)); 60 for(i = 1; i <= A; i++) { 61 for(j = 1; j <= B; j++) { 62 for(k = 1; k <= C; k++) { 63 scanf("%d",&tmp); 64 mp[i][j][k] = tmp; 65 } 66 } 67 } 68 tmp = bfs(); 69 printf("%d\n",tmp < T?tmp:-1); 70 } 71 return 0; 72 }
原文：http://www.cnblogs.com/crackpotisback/p/3945713.html
