Poj.2251.Dungeon Master

Poj.2251.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!

Sample Input

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

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

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

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

0 0 0

Sample Output

Escaped in 11 minute(s).
Trapped!

考点：广度搜索

#include <stdio.h>
#include <string.h>
#include <queue>
using namespace std;

char map[35][35][35];
int vis[35][35][35];
int k,n,m,sx,sy,sz,ex,ey,ez;   //层，行，列，起点，终点
int to[6][3] = {{0,0,1},{0,0,-1},{0,1,0},{0,-1,0},{1,0,0},{-1,0,0}};   //六个方向：上下前后右左

struct node
{
    int x,y,z,step;            //坐标及步数
};

int check(int x,int y,int z)   //条件判断
{
    if(x<0||y<0||z<0||x>=k||y>=n||z>=m||map[x][y][z]=='#'||vis[x][y][z])
        return 1;
    return 0;
}

int bfs()
{
    int i;
    node a,next;
    queue<node> Q;                         //结构体声明
    a.x = sx,a.y = sy,a.z = sz;
    a.step = 0;
    vis[sx][sy][sz] = 1;
    Q.push(a);                             //将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 = a;
            next.x = a.x+to[i][0];
            next.y = a.y+to[i][1];
            next.z = a.z+to[i][2];
            if(check(next.x,next.y,next.z))
                continue;
            vis[next.x][next.y][next.z] = 1;    //标记
            next.step = a.step+1;               //计算所需时间
            Q.push(next);                       //将next压入队列末端
        }
    }
    return 0;
}

int main()
{
    int ans,i,j,r;
    while(scanf("%d%d%d",&k,&n,&m),n+m+k)
    {
        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;          //标记起始位置
                    else if(map[i][j][r]=='E') ex=i,ey=j,ez=r;     //标记终止位置
                }
            }
        memset(vis,0,sizeof(vis));
        ans = bfs();
        if(ans)
            printf("Escaped in %d minute(s).\n",ans);
        else
            printf("Trapped!\n");
    }
}