标签：return star pac possible cube else contain inpu oss
题目：
You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. It takes one minute to move one unit north, south, east, west, up or down. You cannot move diagonally and the maze is surrounded by solid rock on all sides.
Is an escape possible? If yes, how long will it take?
Input
Output
Escaped in x minute(s).
Trapped!
Sample Input
3 4 5
S....
.###.
.##..
###.#
#####
#####
##.##
##...
#####
#####
#.###
####E
1 3 3
S##
#E#
###
0 0 0
Sample Output
Escaped in 11 minute(s).
Trapped!
题意：
相当于一栋大楼里面很多秘密通道，S是起始位置，E是终点位置，‘#’是墙，‘.’是路，问从S出发最少经过多长时间就到达E处；
分析：
和迷宫不同的是，迷宫是平面上东南西北的移动，相当于在大楼里面的一层楼里找出口，而这个题目在迷宫的基础上又增加了上下的移动，即大楼里面的上下层之间的移动，
所以需要建立三维的数组，找到S的位置，移动方向由4个增加到6个，直到找到E为止，如果找遍了所有的能走的地方都没找到出口E，就出不来了！！！
AC代码：
#include<iostream> #include<cstdio> #include<queue> #include<cstring> #include<string> using namespace std; char a[35][35][35]; int b[35][35][35]; int L,R,C; int f[3][6]={{1,-1,0, 0,0, 0}, {0, 0,1,-1,0, 0}, {0, 0,0, 0,1,-1}}; int s2[35][35][35]; int flag; struct Knot { int x,y,z; int step; }; Knot c,d; bool search1(int x,int y,int z) { return (x>=1&&x<=L&&y>=1&&y<=R&&z>=1&&z<=C); } int bfs(int si,int sj,int sk) { queue<Knot>s; c.x=si; c.y=sj; c.z=sk; c.step=0; s.push(c); while (!s.empty()) { d=s.front(); s.pop(); c.step=d.step+1; for (int i=0;i<6;i++) { c.x=d.x+f[0][i]; c.y=d.y+f[1][i]; c.z=d.z+f[2][i]; if (search1(c.x,c.y,c.z)&&!b[c.x][c.y][c.z]&&a[c.x][c.y][c.z]!=‘#‘) { if (a[c.x][c.y][c.z]==‘E‘) return c.step; b[c.x][c.y][c.z]=1; s.push(c); } } } return -1; } int main() { int i,j,k; int si,sj,sk; while (cin>>L>>R>>C&&(L!=0||R!=0||C!=0)) { memset(b,0,sizeof(b)); for (i=1;i<=L;i++) for (j=1;j<=R;j++) for (k=1;k<=C;k++) { cin>>a[i][j][k]; if (a[i][j][k]==‘S‘) { si=i; sj=j; sk=k; } } flag=bfs(si,sj,sk); if (flag==-1) cout << "Trapped!" << endl; else cout << "Escaped in " << flag << " minute(s)." << endl; } return 0; }
标签：return star pac possible cube else contain inpu oss
原文地址：http://www.cnblogs.com/lisijie/p/7233964.html
