Catch That Cow

最新推荐文章于 2022-01-19 03:53:25 发布

这个刹车不太灵

最新推荐文章于 2022-01-19 03:53:25 发布

阅读量253

点赞数

分类专栏：图论

本文链接：https://blog.csdn.net/zheng__jun/article/details/52186202

版权

图论专栏收录该内容

16 篇文章 2 订阅

订阅专栏

Catch That Cow

Time Limit: 2000ms Memory limit: 65536K

题目描述

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?

输入

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

输出

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

示例输入

5 17

示例输出

提示鏈接：poj3278

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.

题意：有一个农民和一头牛，他们在一个数轴上，牛在k位置保持不动，农户开始时在n位置。设农户当前在M位置，每次移动时有三种选择：1.移动到M-1；2.移动到M+1位置；3.移动到M*2的位置。问最少移动多少次可以移动到牛所在的位置。所以可以用广搜来搜索这三个状态，直到搜索到牛所在的位置。

#include<cstdio>
#include<queue>
#include<cstring>
#define N 1000000
using namespace std;

int n,m;
struct node
{
    int d,step;
};
int v[N];
void bfs()
{
    queue<node>q;
    node p;
    p.d=n;
    p.step=0;
    q.push(p);
    v[n]=1;
    while(!q.empty())
    {
        p=q.front();
        q.pop();
        int d=p.d;
        int s=p.step;
        if(d==m)            //最先找到，時間最短
        {
            printf("%d\n",s);
            return ;
        }
        s++;
        d=p.d-1;
        if(d>=0&&!v[d])     //判斷的三個條件
        {
            v[d]=1;
            node k;
            k.d=d;
            k.step=s;
            q.push(k);
        }
        d=p.d+1;
        if(d<=N&&!v[d])
        {
            v[d]=1;
            node k;
            k.d=d;
            k.step=s;
            q.push(k);
        }
        d=p.d*2;
        if(d<=N&&!v[d])
        {
            v[d]=1;
            node k;
            k.d=d;
            k.step=s;
            q.push(k);
        }
    }
}
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        memset(v,0,sizeof(v));
        bfs();
    }
    return 0;
}