1253:Dungeon Master（2.5基本算法之搜索）

最新推荐文章于 2024-09-15 11:05:32 发布

qq_26919935

最新推荐文章于 2024-09-15 11:05:32 发布

阅读量936

点赞数

分类专栏： OpenJudge&ACM算法搜索与递归

本文链接：https://blog.csdn.net/qq_26919935/article/details/78038759

版权

本文探讨了一个3D地牢逃脱问题，你需要在限定时间内找到最快的出路。地牢由单元立方体组成，部分区域被岩石填充。任务是找出从起点'S'到出口'E'的最短路径。输入包括地牢的层数、行数和列数，以及各层的布局。若能逃脱，输出逃脱所需的最短时间；若无法逃脱，则输出"Trapped!"。分析指出，解决这个问题的方法与二维情况相似。

摘要由CSDN通过智能技术生成

1253:Dungeon Master

总时间限制: 1000ms 内存限制: 65536kB
描述
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
T