Catch That Cow POJ - 3278

最新推荐文章于 2025-03-30 16:45:00 发布

原创最新推荐文章于 2025-03-30 16:45:00 发布 · 205 阅读

0 ·

CC 4.0 BY-SA版权

qdu_搜索专栏收录该内容

13 篇文章

订阅专栏

本文介绍了一个有趣的算法问题：一位农夫如何最快地抓住逃跑的奶牛。通过采用广度优先搜索算法，文章详细展示了农夫利用步行和瞬间传送两种方式，在数轴上移动并最终在最短时间内找到静止不动的奶牛的方法。

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

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

Hint

The fastest way for Farmer John to reach the fugitive cow is to move along the following path: 5-10-9-18-17, which takes 4 minutes.

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <queue>
#define inf 0x3f3f3f3f
using namespace std;

int book[100010];
int ans,x,k;

struct node
{
    int x;
    int step;
}a,b;

queue<node>Q;

void bfs()
{
    int i;
    while(!Q.empty())
    {
        a=Q.front();
        Q.pop();
        if(a.x==k)
        {
            ans=a.step;
            return ;
        }
        else
        {
            for(i=0;i<3;i++)
            {
                if(i==0)
                    b.x=a.x+1;
                if(i==1)
                    b.x=a.x-1;
                if(i==2)
                    b.x=a.x*2;
                b.step=a.step+1;
                if(b.x<0||b.x>100000)
                    continue ;
                if(book[b.x]==0)
                {
                    book[b.x]=1;
                    Q.push(b);
                }
            }
        }
    }
    return ;
}

int main()
{
    while(~scanf("%d %d",&x,&k))
    {
        memset(book,0,sizeof(book));
        a.x=x;
        book[x]=1;
        a.step=0;
        Q.push(a);
        bfs();
        printf("%d\n",ans);
    }
    return 0;
}