-----广搜 POJ 3278-Catch That Cow

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

chenchenT_

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

阅读量358

点赞数

CC 4.0 BY-SA版权

分类专栏： -----搜索

本文链接：https://blog.youkuaiyun.com/chenchenQT/article/details/76649049

-----搜索专栏收录该内容

12 篇文章

订阅专栏

本文介绍了一个算法问题，即如何通过行走和瞬移两种方式最快地从起点到达固定终点，以此来帮助农夫John捕捉到一只逃逸的奶牛。文中提供了一段C++代码实现，采用广度优先搜索算法来寻找最短路径。

摘要生成于 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
4
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<queue>
#include<cstring>
#include<cstdio>
using namespace std;

const int maxn=100001;

int vis[maxn],time[maxn];///vis[i]标记i点是否被访问过，time[i]
int n,k;
queue<int>que;

int bfs(int n,int k)
{
    int head,next;
    que.push(n);///n入队
    vis[n]=1;///n点已经被走过了
    time[n]=0;///到达n点的时候走了0步
    while(!que.empty())///当队列非空的时候
    {
        head=que.front();///取出队首元素
        que.pop();
        for(int i=0;i<3;i++)///三种操作
        {
            if(i==0) next=head+1;
                else if(i==1) next=head-1;
                else next=head*2;
            if(next<0||next>=maxn) continue;
            if(vis[next]==0)
            {
                que.push(next);///next入队
                vis[next]=1;///标记next为已经访问过了
                time[next]=time[head]+1;///时间为上一次操作加一
            }
            if(next==k) return time[next];///到达目的地
    }
}
}
int main()
{
    while(~scanf("%d%d",&n,&k))
    {
        memset(vis,0,sizeof(vis));
        memset(time,0,sizeof(time));
        if(n>=k) printf("%d\n",n-k);
        else printf("%d\n",bfs(n,k));
    }
}