HDU3085（双向BFS+曼哈顿距离）题解

最新推荐文章于 2020-03-08 17:26:56 发布

KirinSB

最新推荐文章于 2020-03-08 17:26:56 发布

阅读量628

点赞数

CC 4.0 BY-SA版权

分类专栏：搜索

本文链接：https://blog.youkuaiyun.com/qq_14938523/article/details/79482644

本篇博客详细介绍了如何使用双向BFS策略解决HDU3085问题，并结合曼哈顿距离判断鬼的位置。在问题求解过程中，遇到鬼每步能扩张两格范围的限制，通过判断当前位置是否超过2倍步数与鬼相遇。同时，代码实现中需注意避免鬼已占据的点。

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

Nightmare Ⅱ

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 3012 Accepted Submission(s): 856

Problem Description

Last night, little erriyue had a horrible nightmare. He dreamed that he and his girl friend were trapped in a big maze separately. More terribly, there are two ghosts in the maze. They will kill the people. Now little erriyue wants to know if he could find his girl friend before the ghosts find them.
You may suppose that little erriyue and his girl friend can move in 4 directions. In each second, little erriyue can move 3 steps and his girl friend can move 1 step. The ghosts are evil, every second they will divide into several parts to occupy the grids within 2 steps to them until they occupy the whole maze. You can suppose that at every second the ghosts divide firstly then the little erriyue and his girl friend start to move, and if little erriyue or his girl friend arrive at a grid with a g