POJ-3278 Catch That Cow（bfs）

最新推荐文章于 2022-08-18 18:11:28 发布

五角场的夜风

最新推荐文章于 2022-08-18 18:11:28 发布

阅读量246

点赞数 1

分类专栏：题解文章标签： bfs Catch That Cow POJ ACM 简单搜索

本文链接：https://blog.csdn.net/weixin_41676881/article/details/88934609

版权

农夫约翰得知一头逃犯奶牛的位置，他从点N开始（0 ≤ N ≤ 100,000）在数轴上追赶奶牛，奶牛位于点K（0 ≤ K ≤ 100,000）。约翰有两种移动方式：步行和瞬移。步行可以让他在一分钟内从点X移动到X-1或X+1，瞬移可以让他在一分钟内从点X移动到2X。题目要求找出约翰追捕奶牛所需的最短时间。通过广度优先搜索（BFS）策略，从三个方向（X-1, X+1, 2*X）同时进行搜索，配合动态规划数组记录已到达的点和步数，最终得出约翰需要4分钟才能抓到奶牛。" 52661827,64035,回调函数与消息机制：原理与应用,"['C++', '函数指针', 'Windows消息机制', '编程设计', '异步编程']

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

Problem 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: T