openjudge2.5基本算法之搜索——1159:Maze

原创

已于 2024-06-24 00:56:48 修改 · 754 阅读

13 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #广度优先

于 2024-03-29 11:43:44 首次发布

文章讲述了Acm在特殊迷宫中的寻宝过程，需要找到所有门的钥匙才能打开通往宝藏的门。通过广度优先搜索算法判断Acm能否找到宝藏。

题目

`1159:Maze
描述
Acm, a treasure-explorer, is exploring again. This time he is in a special maze, in which there are some doors (at most 5 doors, represented by ‘A’, ‘B’, ‘C’, ‘D’, ‘E’ respectively). In order to find the treasure, Acm may need to open doors. However, to open a door he needs to find all the door’s keys (at least one) in the maze first. For example, if there are 3 keys of Door A, to open the door he should find all the 3 keys first (that’s three 'a’s which denote the keys of ‘A’ in the maze). Now make a program to tell Acm whether he can find the treasure or not. Notice that Acm can only go up, down, left and right in the maze.
输入
The input consists of multiple test cases. The first line of each test case contains two integers M and N (1 < N, M < 20), which denote the size of the maze. The next M lines give the maze layout, with each line containing N characters. A character is one of the following: ‘X’ (a block of wall,