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?

输入

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.

输出

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!

思路

题目意思是一个三维空间，你的初始地点为S你需要通过进行上下左右前后的移动去往E点如果可以到达则输出到达的时间，如果不可以到达则输出 Trapped!
看到题目是求最短路径，考虑BFS，因为是三维图，所以移动方向有6个。
具体实现
1：在输入时对目标终点，起点进行判断并且记录下来坐标
2：通过判断这个方向是否可以走来进行移动
3：利用结构体和队列来进行具体的实现步骤
易错点提示
1：这道题输入是先输入层数，然后是行，其次才是列，这点非常容易弄混淆。
2：对于能不能走的判断，需要注意是否越界，是否走过，是否是墙。
这道题其实仔细读题，认真写基本上就是套用BFS的模板
以下为源代码

#include <iostream>
#include <string.h>
#include <algorithm>
#include <stdio.h>
#include <queue>
using namespace std;
const int INF=1000000;
char maze[35][35][35];
int n,m,k;
int sy,sx,sz;
int gx,gy,gz;
int d[35][35][35];
int to[6][3] = {{0,0,1},{0,0,-1},{0,1,0},{0,-1,0},{1,0,0},{-1,0,0}};
class Node
{
public:
    int x,y,z,leng;
};
int check(int x,int y,int z)
{
    if(x<0 || y<0 || z<0 || x>=k || y>=n || z>=m)
        return 1;
    else if(maze[x][y][z] == '#')
        return 1;
    else if(d[x][y][z]==INF)
        return 1;
    return 0;
}
int bfs()
{
    int i;
    Node a,next;
    queue<Node> tang;
    a.x = sx,a.y = sy,a.z = sz;
    a.leng = 0;
    d[sx][sy][sz] = INF;
    tang.push(a);
    while(!tang.empty())
    {
        a=tang.front();
        tang.pop();
        if(a.x==gx&&a.y==gy&&a.z==gz)
            return a.leng;
        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;
            }
            d[next.x][next.y][next.z]=INF;
            next.leng=a.leng+1;
            tang.push(next);
        }
    }
    return 0;
}
int main()
{
    int i,j,f;
    while(scanf("%d%d%d",&k,&n,&m),k+n+m)
    {
        for(i=0; i<k; i++)
            for(j=0; j<n; j++)
            {
                scanf("%s",maze[i][j]);
                for(f = 0; f<m; f++)
                {
                    if(maze[i][j][f] == 'S')
                    {
                        sx = i,sy = j,sz = f;
                    }
                    else if(maze[i][j][f] == 'E')
                    {
                        gx = i,gy = j,gz = f;
                    }
                }
            }
        memset(d,0,sizeof(d));
        int tme;
        tme=bfs();
        if(tme)
        {
            cout<<"Escaped in "<<tme<<" minute(s)."<<endl;
        }
        else
        {
            cout<<"Trapped!"<<endl;
        }
    }
    return 0;
}