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?
输入描述:
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!
输入：
3 4 5
S…
.###.
.##…
###.#

##.##
##…

#.###
####E

1 3 3
S##
#E#

0 0 0
输出：
Escaped in 11 minute(s).
Trapped!
题意：
空间由立方体单位构成
你每次向上下前后左右移动一个单位需要一分钟
你不能对角线移动并且四周封闭
是否存在逃出生天的可能性？如果存在，则需要多少时间？
题解：
简单三维BFS
代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;

int l,r,c;
const int maxn = 50;
char s[maxn][maxn][maxn];
int vis[maxn][maxn][maxn];
int dir[6][3]={{-1,0,0},{1,0,0},{0,1,0},{0,-1,0},{0,0,1},{0,0,-1}};
struct point{
    int x,y,z;
};
point st,ed;

int bfs(){
    queue<point> q;
    q.push(st);
    point next;
    while(!q.empty()){
        point tmp = q.front();
        q.pop();
        for(int i = 0; i < 6; i ++){
            next.x = tmp.x + dir[i][0];
            next.y = tmp.y + dir[i][1];
            next.z = tmp.z + dir[i][2];
            if(next.x >= 0 && next.x < l && next.y >= 0 && next.y < r && next.z >= 0 && next.z < c && s[next.x][next.y][next.z] != '#' && vis[next.x][next.y][next.z] == 0){
                vis[next.x][next.y][next.z] = vis[tmp.x][tmp.y][tmp.z] + 1;
                if(next.x == ed.x && next.y == ed.y && next.z == ed.z){
                    return vis[next.x][next.y][next.z];
                }
                q.push(next);
            }
        }
    }
    return -1;
}

int main(){
    while(scanf("%d%d%d",&l,&r,&c)!=EOF){
        if(l == 0 && r == 0 && c == 0) break;
        getchar();
        memset(vis,0,sizeof(vis));
        for(int i = 0; i < l; i ++){
            for(int j = 0; j < r; j ++){
                for(int k = 0; k < c; k ++){
                    cin>>s[i][j][k];
                }
            }
        }
        for(int i = 0; i < l; i ++){
            for(int j = 0; j < r; j ++){
                for(int k = 0; k < c; k ++){
                   if(s[i][j][k] == 'S'){
                        st.x = i;
                        st.y = j;
                        st.z = k;
                   }
                   if(s[i][j][k] == 'E'){
                        ed.x = i;
                        ed.y = j;
                        ed.z = k;
                   }
                }
            }
        }
        int ans = bfs();
        if(ans == -1) printf("Trapped!\n");
        else printf("Escaped in %d minute(s).\n",ans);
    }
    return 0;
}