Catch That Cow（C语言）

最新推荐文章于 2022-03-31 23:03:56 发布

qiandfeng

最新推荐文章于 2022-03-31 23:03:56 发布

阅读量550

点赞数

分类专栏：搜索BFS 文章标签： BFS

本文链接：https://blog.csdn.net/shuati2000/article/details/99086150

版权

农夫约翰得知一头逃犯奶牛的位置，他从数轴上的点N出发，目标是点K。FJ有两种移动方式：步行和瞬移。通过BFS广度优先搜索，寻找最短时间路径来捕捉奶牛。样例输入5和17，输出为4，表示FJ需要4分钟抓到奶牛。解题关键在于避免解答树的无限深入和剪枝。详情见解题思路链接。

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

Description

Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and the cow is at a point K (0 ≤ K ≤ 100,000) on the same number line. Farmer John has two modes of transportation: walking and teleporting.

Walking: FJ can move from any point X to the points X - 1 or X + 1 in a single minute
Teleporting: FJ can move from any point X to the point 2 × X in a single minute.

If the cow, unaware of its pursuit, does not move at all, how long does it take for Farmer John to retrieve it?

Input

Line 1: Two space-separated integers: N and K
Output

Line 1: The least amount of time, in minutes, it takes for Farmer John to catch the fugitive cow.
Sample Input

5 17
Sample Output

4
Hint

The fastest way for Farmer John to reach the fugitive cow is to move along the following pat