C++_BFS求最短路径

最新推荐文章于 2024-09-20 00:06:58 发布

Gummary

最新推荐文章于 2024-09-20 00:06:58 发布

阅读量3k

点赞数

分类专栏：计算机算法 C++

本文链接：https://blog.csdn.net/a7055117a/article/details/51356471

版权

这篇博客讲述了如何使用BFS算法解决一个救援任务问题：在一个包含墙壁、道路和守卫的N×M矩阵监狱中，计算救出被囚禁的天使所需的最短时间。题目要求在遇到守卫时需要花费1单位时间将其击败，并且只能向上、下、左、右移动。博主分享了解题过程中的注意事项和解决方案。

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

Description

Angel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M <= 200) matrix. There are WALLs, ROADs, and GUARDs in the prison.

Angel’s friends want to save Angel. Their task is: approach Angel. We assume that “approach Angel” is to get to the position where Angel stays. When there’s a guard in the grid, we must kill him (or her?) to move into the grid. We assume that we moving up, down, right, left takes us 1 unit time, and killing a guard takes 1 unit time, too. And we are strong enough to kill all the guards.

You have to calculate the minimal time to approach Angel. (We can move only UP, DOWN, LEFT and RIGHT, to the neighbor grid within bound, of course.)

Input

First line contains two integers stand for N and M.

Then N lines follows, every line has M characters. “.” stands for road, “a” stands for Angel, and “r” stands for each of Angel’s friend.

Process to the end of the file.

Output

For each test case, your program should output a single integer, standing for the minimal time needed. If such a number does no exist, you should output a line containing “Poor ANGEL has to stay in the prison all his life.”