POJ2251-Dungeon Master(3维BFS)

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

The input consists of a number of dungeons. Each dungeon description starts with a line containing three integers L, R and C (all limited to 30 in size). 
L is the number of levels making up the dungeon. 
R and C are the number of rows and columns making up the plan of each level. 
Then there will follow L blocks of R lines each containing C characters. Each character describes one cell of the dungeon. A cell full of rock is indicated by a '#' and empty cells are represented by a '.'. Your starting position is indicated by 'S' and the exit by the letter 'E'. There's a single blank line after each level. Input is terminated by three zeroes for L, R and C.

Output

Each maze generates one line of output. If it is possible to reach the exit, print a line of the form 

Escaped in x minute(s).

where x is replaced by the shortest time it takes to escape. 
If it is not possible to escape, print the line 

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，就出不来了！！！
#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
using namespace std;
int zz, xx, yy, tx, ty, tz;
int start_x, start_y, start_z, end_x, end_y, end_z; 
char ch;
int map[40][40][40];
int book[40][40][40];

int d[6][3] ={-1,0,0,1,0,0,0,-1,0,0,1,0,0,0,1,0,0,-1};



struct node{
    int x,y,z;
    int step;
}q;

void BFS(){
    q.x = start_x,q.y = start_y,q.z = start_z;
    q.step = 0;
    queue<node>qq;
    qq.push(q);
    book[start_x][start_y][start_z] = 1;
    while(!qq.empty()){
        node t = qq.front();
        qq.pop();
        
//        cout<<" x y z ="<<t.x<<" "<<t.y<<" "<<t.z<<endl;
        if(t.x==end_x && t.y==end_y && t.z == end_z){
            cout<<"Escaped in "<<t.step<<" minute(s)."<<endl;
            return;
        }
        for( int i = 0; i < 6; i++ ) {
            
            tz = t.z + d[i][0]; 
            tx = t.x + d[i][1];
            ty = t.y + d[i][2];
            if( tz>zz||tz<1 || tx>xx||tx<1 || ty>yy||ty<1 ) continue;
            if( map[tz][tx][ty] == 0 && book[tz][tx][ty]==0 ){
                node temp;
                book[tz][tx][ty]=1;
                temp.z = tz, temp.x = tx, temp.y = ty;
                temp.step = t.step + 1;
                qq.push(temp);
            }
        }
    }
    cout<<"Trapped!"<<endl;
    return;
}

int main() {
    while(scanf("%d%d%d",&zz,&xx,&yy),zz+xx+yy)
    {
       
        for( int i = 1; i <= zz; i++ ) {
            for( int j = 1; j <= xx; j++ ) {
                for( int k = 1; k <= yy; k++ ) {
                    cin>>ch;
                    switch(ch){
                        case 'S':start_z = i,start_x = j,start_y = k; break;
                        case 'E':end_z = i, end_x = j, end_y = k; break;
                        case '.':map[i][j][k] = 0;break;
                        case '#':map[i][j][k] = 1;break;
                    }
                }
            }
        }
        memset(book,0,sizeof(book));
        BFS();
    }
    return 0;
}