【搜索入门专题1】 hdu1242 J - Rescue c++ stl容器之优先队列+BFS

最新推荐文章于 2024-06-17 09:26:35 发布

努力过

最新推荐文章于 2024-06-17 09:26:35 发布

阅读量432

点赞数

分类专栏： ACM--搜索 HDUOJ Vjudge 比赛练习

本文链接：https://blog.csdn.net/hello_sheep/article/details/76409096

版权

这篇博客介绍了如何使用C++标准模板库（STL）中的优先队列（priority_queue）配合广度优先搜索（BFS）来解决HDU1242 Rescue问题。通过实例解析，阐述了优先队列在解决搜索问题中的应用，以及在算法设计中的关键作用。

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

Rescue

Problem 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 follow