标签：des c class a tar int
Dungeon Master
| Time Limit: 1000MS |
|
Memory Limit: 65536K |
| Total Submissions: 15868 |
|
Accepted: 6162 |
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!
Sample Input
3 4 5
S....
.###.
.##..
###.#
#####
#####
##.##
##...
#####
#####
#.###
####E
1 3 3
S##
#E#
###
0 0 0
Sample Output
Escaped in 11 minute(s).
Trapped!
Dungeon Master,布布扣,bubuko.com
Dungeon Master
标签：des c class a tar int
原文地址：http://www.cnblogs.com/acmer-jsb/p/3762946.html
