openjudge2.5基本算法之搜索1253:Dungeon Master

原创

已于 2024-06-24 01:01:48 修改 · 868 阅读

7 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #广度优先 #c++

于 2024-04-03 18:56:20 首次发布

本文介绍了一种在3D迷宫中寻找最短逃生路线的问题，利用宽搜索算法遍历所有可能的路径，计算从起点到出口的最短时间，如果找到出口则输出逃脱时间，否则表示被困。

题目

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