Dungeon Master（https://acs.jxnu.edu.cn/problem/NOIOPJCH02051253）

题目：

Dungeon Master

 1000ms  65536K

描述：

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!

翻译：

描述：

你被困在一个3D的地牢里，需要找出最快的路径！这个地牢是由单位立方体组成的，也许没有被岩石填满，向北，南，东，西，上，下移动需要花费一分钟，你不能斜着移动并且这个迷宫四周被坚固的岩石所包围。

有可能逃脱吗？如果是，需要花费多长时间？

输入：

输入包含大量地牢，每个地牢开始的一行包含三个整数 L, R 和 C（所有大小限制为30）。 

L是组成地牢的关卡数。R和C是组成每个级别的计划的行和列数量。

然后包含L块R行，每行包含C个字符，每个字符描述地牢中的一个单元格，一个充满岩石的单元格用一个'#'表示并且一个空的单元格用 '.'表示.你开始的位置用'S'表示并且出口用'E'表示.在每个级别之后有一个空行。输入以 L、R 和 C 的三个零终止。

输出：

每一个地牢产生一行输出，如果可能到达出口，以这种形式打印一行

    Escaped in x minute(s).

X表示逃离所花费的最短时间，如果不可能逃离，打印一行

Trapped!