Catch That Cow

Catch That Cow

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.

思路：bfs+剪枝，可行性剪枝，当N>K时只能 x-1。

AC代码

#include<cstdio>
#include<iostream>
#include<queue>
#include<cstring>
using namespace std;
const int maxn = 1e6+10;
int dis[maxn];
int n,m;

int main()
{
    memset(dis,0,sizeof(dis));
    cin >>n>>m;
    queue<int> q;
    int ans=0;
    q.push(n);
    dis[n]=1;
    while(!q.empty())
    {
        int x = q.front();
        q.pop();
        if(x==m)
        {
            ans = dis[x];
            break;
        }
        if(x>0 && !dis[x-1])
        {
            q.push(x-1);
            dis[x-1] = dis[x]+1;
        }
        if(x<m && !dis[x+1])
        {
            q.push(x+1);
            dis[x+1] = dis[x]+1;
        }
        if(x<m && !dis[2*x])
        {
            q.push(2*x);
            dis[2*x] = dis[x]+1;
        }
        
    }
    
    cout<<ans-1<<endl;
    return 0;


}