HDU-2621 Find a way（bfs）

最新推荐文章于 2020-09-27 17:10:37 发布

五角场的夜风

最新推荐文章于 2020-09-27 17:10:37 发布

阅读量274

点赞数 1

分类专栏：题解文章标签： ACM HDU bfs C++ 算法

本文链接：https://blog.youkuaiyun.com/weixin_41676881/article/details/88749338

版权

该博客介绍了如何使用广度优先搜索（BFS）算法解决HDU-2621问题，即两个人从不同位置出发，通过四方向移动寻找最近的KFC会合，目标是最小化两人到达KFC的总时间。博主给出了详细的思路分析和AC代码，说明了在BFS过程中如何记录并计算最小时间。

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

Problem Description:

Pass a year learning in Hangzhou, yifenfei arrival hometown Ningbo at finally. Leave Ningbo one year, yifenfei have many people to meet. Especially a good friend Merceki.
Yifenfei’s home is at the countryside, but Merceki’s home is in the center of city. So yifenfei made arrangements with Merceki to meet at a KFC. There are many KFC in Ningbo, they want to choose one that let the total time to it be most smallest.
Now give you a Ningbo map, Both yifenfei and Merceki can move up, down ,left, right to the adjacent road by cost 11 minutes.

Input:

The input contains multiple test cases.
Each test case include, first two integers n, m. (2<=n,m<=200).
Next n lines, each line included m character.
‘Y’ express yifenfei initial position.
‘M’ express Merceki initial position.
‘#