ZOJ - 1649：Rescue

wingrez

于 2018-05-27 00:29:04 发布

阅读量365

点赞数

CC 4.0 BY-SA版权

分类专栏：【记录】算法题解

本文为博主原创文章，未经博主允许不得转载。

本文链接：https://blog.youkuaiyun.com/wingrez/article/details/80463430

【记录】算法题解专栏收录该内容

229 篇文章 ¥19.90 ¥99.00

订阅专栏

超级会员免费看

该博客介绍了ZOJ中的一道问题1649：Rescue。问题背景设定为Angel被MOLIGPY囚禁在监狱里，朋友们需要在包含墙壁、道路和守卫的矩阵地图上找到到达Angel的最短路径并击杀守卫。每个移动或击杀守卫都需要1单位时间，且朋友们有足够的实力。输入和输出格式、样例以及解题思路和参考代码都进行了详细说明。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

ZOJ - 1649：Rescue

来源：

标签：

参考资料：

相似题目：

题目

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 A