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 SpecificationThe input file consists of a number of dungeons. Each dungeon description starts with a line containing three integersL,RandC(all limited to 30 in size).
Lis the number of levels making up the dungeon.
RandCare the number of rows and columns making up the plan of each level.
Then there will followLblocks ofRlines each containingCcharacters. 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 forL,RandC.
Output SpecificationEach maze generates one line of output. If it is possible to reach the exit, print a line of the form
Escaped inxminute(s).
wherexis replaced by the shortest time it takes to escape.
If it is not possible to escape, print the line
Trapped!
Sample Input3 4 5S…..###..##..###.#############.####…###########.#######E1 3 3S###E####0 0 0Sample OutputEscaped in 11 minute(s).Trapped!
，因害怕失败而不敢放手一搏，永远不会成功
