Catch That Cow

最新推荐文章于 2021-03-24 20:59:05 发布

liqiang1401

最新推荐文章于 2021-03-24 20:59:05 发布

阅读量223

点赞数

本文链接：https://blog.csdn.net/liqiang1401/article/details/52253972

版权

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 有链接提示的题目请先去链接处提交程序，AC后提交到SDUTOJ中，以便查询存档。
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<bits/stdc++.h>
using namespace std;
int a[10000001],q;
queue<int >f;
void bfs(int n,int k)
{
    a[n]=1;
    while(!f.empty())
    {
        q=f.front();
        f.pop();
        if((q>=1)&&a[q-1]==0)

//控制数组防止越界和判断此数是否被压入过栈


        {
            a[q-1]=a[q]+1;
            if((q-1)==k)
            {
                cout<<a[q];
                return ;
            }
            f.push(q-1);
        }
        if((q<=k)&&a[q+1]==0)//控制数组防止越界和判断此数是否被压入过栈
        {
            a[q+1]=a[q]+1;
            if((q+1)==k)
            {
                cout<<a[q];
                return ;
            }
            f.push(q+1);
        }
        if((q<=k)&&a[2*q]==0)

//控制数组防止越界和判断此数是否被压入过栈


        {
            a[2*q]=a[q]+1;
            if((2*q)==k)
            {
                cout<<a[q];
                return ;
            }
            f.push(2*q);

        }
    }
}

int main()
{
    int n,k;
    memset(a,0,sizeof(a));
    cin>>n>>k;
    f.push(n);
    if(n==k)
    cout<<0;
    else
    bfs(n,k);
}