ACM-BFS之Rescue——hdu1242

最新推荐文章于 2019-04-10 22:11:30 发布

ltree98

最新推荐文章于 2019-04-10 22:11:30 发布

阅读量1.5k

点赞数

分类专栏： ACM-搜索漫漫刷题路文章标签： ACM BFS Rescue hdu1242

本文链接：https://blog.csdn.net/lttree/article/details/23259863

版权

这是一道ACM竞赛中的BFS问题，目标是从'r'位置出发找到最短路径到达'a'， '.'代表可通行，'#'为墙壁，'x'代表花费2秒的障碍。求解最短步数，无法到达则输出-1。注意，'r'表示天使的朋友，地图中可能有多个'r'，但实际问题中'r'只有一个。

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

Rescue
题目： http://acm.hdu.edu.cn/showproblem.php?pid=1242
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,