Catch That Cow

Catch That Cow

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 74214		Accepted: 23395

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

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.

光搜，3种状态分别是向右走一步，向左走一步，向右走K步。

#include <iostream>
#include <cstdio>
#include <queue>
#include <cstring>
#include <string>
#include <algorithm>

using namespace std;
int n,m;
int vis[100005],step[100005];
int bfs(int i)
{
    vis[i]=1;
    step[i]=0;
    queue<int>Q;
    Q.push(i);
    while(!Q.empty())
    {
        int k=Q.front();
        Q.pop();
        if(k==m)return step[k];
        int t=k+1;
        if(!vis[t]&&t<=100000)
        {
            vis[t]=1;
            step[t]=step[k]+1;
            Q.push(t);
        }
        t=k-1;
        if(!vis[t]&&t>=0)
        {
            vis[t]=1;
            step[t]=step[k]+1;
            Q.push(t);
        }
        t=k*2;
        if(!vis[t]&&t<=100000)
        {
            vis[t]=1;
            step[t]=step[k]+1;
            Q.push(t);
        }
    }
    return 0;//不加就是wa你能怎么滴，有毒QAQ
}
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        memset(vis,0,sizeof(vis));
        int ans=bfs(n);
        printf("%d\n",ans);
    }
    return 0;
}