1.23英文题面翻译

描述

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!

OpenJudge - 1253:Dungeon Master

翻译

描述

你被关在了一个三维的地牢里，并且需要找到出去的最快办法！地牢由数个可能被填充了 岩石货没有的小房间组成，移动到东南西北或者上下相邻的小房间需要一分钟，你不能移动到对角线小房间里，并且地牢的四周都是坚硬的岩石。

你有可能逃脱吗？如果有，需要花多少时间？

输入

输入由一些地牢组成。每个地牢都以一行三个整数L,R,C开始（整数都小于30）。L是地牢的层数。R和C表示地牢每一层的行和列数量。然后将会有包含C个字符的L行R列，每一个字符描述了一个小房间。堆满了石头的房间用“#”，空的房间用“.”。你的起始位置是“S”，终点是“E”。每组输入后有一行空格，输入以L,R,C都为0时终止。

输出

每个地牢有一行输出。如果存在逃脱的可能，输出下面这行

Escaped in x minute(s).

x代表逃脱所需要的最短时间。如果不能逃脱，请输出

Trapped!