POJ 2251 Dungeon Master（BFS）

Dungeon Master

Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 28010 Accepted: 10932
Description

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!

题目大意：
多组输入数据，每次输入给定一个空间几何体的长宽高，按层给出迷宫（终点和起点不一定在一层上），每次可以选择向前、后、左、右、上、下六个方向中的一个方向行动一次。求给定的三维迷宫是否存在可以到达的方案，如果是输出Escaped in x minute(s).(x是最短路径)，否则输出Trapped!

思路：
普通的BFS求最短路径 只需要加一维对高度的判断即可、

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
int n,m,h,sx,sy,sz,ex,ey,ez;
int dx[]={0,1,-1,0,0,0,0},dy[]={0,0,0,1,-1,0,0},dz[]={0,0,0,0,0,1,-1};
char mp[105][105][105];
bool vis[105][105][105];
struct poi{
    int x,y,z,step;
};
bool check(int x,int y,int z)
{
    if(x>0&&y>0&&z>0&&x<=n&&y<=m&&z<=h&&!vis[x][y][z]&&mp[x][y][z]!='#')
    return true;
    return false;
}
queue<poi>q;
void bfs()
{
    poi s;
    s.x = sx;
    s.y = sy;
    s.z = sz;
    s.step = 0;
    q.push(s);
    vis[sx][sy][sz] = 1;
    while(!q.empty())
    {
        poi u = q.front();
        q.pop();
        poi nxt;
        for(int i = 1;i <= 6;i ++)
        {
            nxt.x = u.x + dx[i];
            nxt.y = u.y + dy[i];
            nxt.z = u.z + dz[i];
            if(check(nxt.x,nxt.y,nxt.z))
            {
                nxt.step = u.step + 1;
                vis[nxt.x][nxt.y][nxt.z] = 1;
                if(mp[nxt.x][nxt.y][nxt.z] == 'E')
                {
                    printf("Escaped in %d minute(s).\n",nxt.step);
                    return; 
                }
                q.push(nxt);
            }
        }
    }
    printf("Trapped!\n");
    return;
}
int main()
{
    while(1)
    {
        scanf("%d%d%d",&n,&m,&h);
        if(h == 0 && n == 0 && m == 0) break;
        while(!q.empty()) q.pop();
        memset(vis,0,sizeof(vis));
        memset(mp,0,sizeof(mp));
        for(int i = 1;i <= n;i ++)
        for(int j = 1;j <= m;j ++)
        for(int k = 1;k <= h;k ++)
        {
            cin >> mp[i][j][k];
            if(mp[i][j][k] == 'S')
            {
                sx = i;
                sy = j;
                sz = k;
            }
        }
        bfs();
    }
    return 0;
}