Catch That Cow

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

my_name_is_BUG

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

阅读量373

点赞数

CC 4.0 BY-SA版权

文章标签：宽度搜索

本文链接：https://blog.youkuaiyun.com/qq2512446791/article/details/50718564

探讨了在给定坐标下，如何通过最优路径和时间策略，利用行走和瞬间传送能力，快速捕捉到静止的奶牛。采用宽度优先搜索算法解决此问题，确保找到从起点到目标点的最短路径。

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: 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.

大体题意：John 去抓奶牛，题目给出Joh和奶牛的坐标，求John抓住奶牛的最短时间。其中john可以前进，后退，传送。使用宽搜解这个题，最先找到的结果就是最短时间。

先算+1，再-1，最后*2.注意搜索时的上下限。

代码：

//Catch That Cow
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cctype>
#include<list>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>


using namespace std;


const int MAXN = 2000000;
//int n, m;
typedef pair<int, int> P;
int n,m;
bool num[MAXN];
queue<P> que;


int bfs(int x,int y,int ans)
{
    if(y - x <= 0) return ans = x - y;
    while(!que.empty()) que.pop();
    que.push(P(x,ans));
    while(!que.empty())
    {
        P p = que.front();
        que.pop();
        if(p.first == y) return p.second;
        if(p.first + 1 >= 0&&p.first + 1 <= 100000 && !num[p.first+1])
        {
            num[p.first+1] = true;
            que.push(P(p.first + 1, p.second + 1));
        }
        if(p.first >= 0&&p.first - 1 <= 100000 && !num[p.first-1])
        {
            num[p.first-1] = true;
            que.push(P(p.first - 1, p.second + 1));
        }
        if(p.first * 2 >= 0&&p.first * 2  <= 100000 && !num[p.first*2])
        {
            num[p.first*2] = true;
            que.push(P(p.first * 2, p.second + 1));
        }


    }
    return 0;
}


int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        memset(num,false,sizeof(num));
        printf("%d\n",bfs(n,m,0));
    }
    return 0;
}