标签:des style blog http io ar color os 使用
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 26070 Accepted Submission(s): 9950
1 #include<stdio.h> 2 #include<math.h> 3 #include<stdlib.h> 4 #include<string.h> 5 #include<queue> 6 using namespace std; 7 int map[55][55][55]; 8 int dir[6][3]={{1,0,0},{-1,0,0},{0,0,1},{0,0,-1},{0,1,0},{0,-1,0}}; 9 int a,b,c,t; 10 struct ln{ 11 int x; 12 int y; 13 int z; 14 int t; 15 }abc,q; 16 int border(int x,int y,int z) 17 { 18 if( (x>=0&&x<a) && (y>=0&&y<b) &&(z>=0&&z<c) &&!map[x][y][z] ) 19 return 1; 20 return 0; 21 } 22 int bfs() 23 { 24 int i; 25 queue<struct ln>p; 26 abc.x=0; 27 abc.y=0; 28 abc.z=0; 29 abc.t=0; 30 map[0][0][0]=1; 31 p.push(abc); 32 while(!p.empty()) 33 { 34 abc=p.front(); 35 p.pop(); 36 if(abc.t>t) 37 { 38 return 0; 39 } 40 if(abc.x==(a-1) && abc.y==(b-1) && abc.z==(c-1)) 41 { 42 return abc.t; 43 } 44 45 for(i=0;i<6;i++) 46 { 47 q.x=abc.x+dir[i][0]; 48 q.y=abc.y+dir[i][1]; 49 q.z=abc.z+dir[i][2]; 50 if(border(q.x,q.y,q.z)) 51 { 52 q.t=abc.t+1; 53 if(fabs(q.x-a+1)+fabs(q.y-b+1)+fabs(q.z-c+1)+q.t>t)//剪枝 54 continue; 55 p.push(q); 56 map[q.x][q.y][q.z]=1; 57 } 58 } 59 } 60 return 0; 61 } 62 int main() 63 { 64 //freopen("in.txt","r",stdin); 65 int K; 66 scanf("%d",&K); 67 while(K--) 68 { 69 scanf("%d%d%d%d",&a,&b,&c,&t); 70 for(int i=0;i<a;i++) 71 { 72 for(int j=0;j<b;j++) 73 { 74 for(int k=0;k<c;k++) 75 { 76 scanf("%d",&map[i][j][k]); 77 } 78 } 79 } 80 int count=0; 81 count=bfs(); 82 if(count) 83 { 84 printf("%d\n",count); 85 } 86 else 87 printf("-1\n"); 88 } 89 return 0; 90 }
标签:des style blog http io ar color os 使用
原文地址:http://www.cnblogs.com/xuesen1995/p/4112826.html