Dungeon Master

题目：

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!

 Input

3 4 5
S....
.###.
.##..
###.#

#####
#####
##.##
##...

#####
#####
#.###
####E

1 3 3
S##
#E#
###

0 0 0

Sample Output

Escaped in 11 minute(s).
Trapped!

题意：

先给你三个数字，代表地牢的长 宽 高，S代表被困的地方，E代表出口，每次只能上 下 左 右 前 后 移动一步，# 代表障碍物，. 代表道路，能否逃出地牢，如果能逃出，求最短的逃出时间，输出逃出时间，否则输出 被困。

代码如下：

#include<stdio.h>
#include<string.h>
#include<queue>
using namespace std;
 
char map[50][50][50];
int book[50][50][50];
int k,n,m,sx,sy,sz,ex,ey,ez;
int nextt[6][3]={{0,0,1},{0,0,-1},{0,1,0},{0,-1,0},{1,0,0},{-1,0,0}};
 
struct node
{
    int x;
    int y;
    int z;
    int step;
};
 
int bfs()
{
    int i;
    node a,next;
    queue<node>Q;
    a.x=sx;
    a.y=sy;
    a.z=sz;
    a.step=0;
    book[a.x][a.y][a.z]=1;
    Q.push(a);
    while(!Q.empty())
    {
        a=Q.front();
        Q.pop();
        if(a.x==ex&&a.y==ey&&a.z==ez)//到达出口，返回最少的步数；
            return a.step;
        for(i=0;i<6;i++)
        {
            next.x=a.x+nextt[i][0];
            next.y=a.y+nextt[i][1];
            next.z=a.z+nextt[i][2];
            if(next.x<0||next.x>=k||next.y<0||next.y>=n||next.z<0||next.z>=m)
                continue;//出界，continue；
            if(book[next.x][next.y][next.z]==1||map[next.x][next.y][next.z]=='#')
                continue;//遇到障碍物，或者这条路被走过，continue；
            book[next.x][next.y][next.z]=1;//否者把这条路标记为走过；
            next.step=a.step+1;//步数加一；
            Q.push(next);//把这个位置入队列；
        }
    }
    return 0;
}
 
int main()
{
    while(~scanf("%d%d%d",&k,&n,&m))
    {
        if(k==0&&n==0&&m==0)
            break;
        int i,j,r;
        for(i=0;i<k;i++)
        {
            for(j=0;j<n;j++)
            {
                scanf("%s",&map[i][j]);
                for(r=0;r<m;r++)
                {
                    if(map[i][j][r]=='S')//记下起点；
                    {
                        sx=i;
                        sy=j;
                        sz=r;
                    }
                    if(map[i][j][r]=='E')//记下终点；
                    {
                        ex=i;
                        ey=j;
                        ez=r;
                    }
                }
            }
        }
        memset(book,0,sizeof book);
        int kk=bfs();
        if(kk==0)
            printf("Trapped!\n");
        else
        printf("Escaped in %d minute(s).\n",kk);
    }
    return 0;
}