找牛

D - D

Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  POJ 3278

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.

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<queue>
using namespace std;
int map[100010];
int vis[100010];

int mv[2]={-1,1};
int n,k;
struct node
{
    int x,time;
};
void bfs(int a,int b)
{
    queue<node>Q;
    node next,f;
    f.time=0;
    f.x=a;

    Q.push(f);
    while(!Q.empty())
    {
        f=Q.front();
        Q.pop();
        if(f.x==b)
        {
            printf("%d\n",f.time);
            return;
        }


        if(f.x-1>=0&&f.x<=100000&&!vis[f.x-1])
        {

            next.x=f.x+mv[0];
            next.time=f.time+1;
            vis[f.x-1]=1;
            if(next.x==b)
            {
                printf("%d\n",next.time);
                return;

            }
            Q.push(next);
        }




        if(f.x+1>=0&&f.x+1<=100000&&!vis[f.x+1])
        {
            next.x=f.x+mv[1];
            next.time=f.time+1;
            vis[f.x+1]=1;
            if(next.x==b)
            {
                printf("%d\n",next.time);
                return;

            }
            Q.push(next);


        }
        if(2*f.x>=0&&2*f.x<=100000&&!vis[2*f.x])
        {
            next.x=2*f.x;
            next.time=f.time+1;
            vis[2*f.x]=1;
            if(next.x==b)
            {
                printf("%d\n",next.time);
                return;

            }
            Q.push(next);


        }



    }



}
int main()
{
    while(scanf("%d%d",&n,&k)!=EOF)
    {
        bfs(n,k) ;
    }
    return 0;
}