Catch That Cow

Catch That Cow

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 60573		Accepted: 18904

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 <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
using namespace std;
struct node
{
    int x;
    int step;
};
int m,n;
bool flag[200010];
int  bfs()
{
    memset(flag,0,sizeof(flag));
    node now,tmp;
    now.x=n;
    now.step=0;
    flag[n]=1;
    queue<node>Q;
    Q.push(now);
    while(!Q.empty())
    {
        now=Q.front();
        Q.pop();
        if(now.x==m)
        {
            return now.step;
        }
        for(int i=0; i<3; i++)
        {
            tmp=now;
            if(i==0)
            {
                if(tmp.x>0&&!flag[tmp.x-1])
                {
                    tmp.x--;
                    tmp.step++;
                    flag[tmp.x]=1;
                    Q.push(tmp);
                }
            }
            if(i==1)
            {
                if(!flag[tmp.x+1])
                {
                    tmp.x++;
                    tmp.step++;
                    flag[tmp.x]=1;
                    Q.push(tmp);
                }
            }
            else if(i==2)
            {
                if(tmp.x<100010&&!flag[tmp.x*2])
                {
                    tmp.x*=2;
                    tmp.step++;
                    flag[tmp.x]=1;
                    Q.push(tmp);
                }
            }
        }

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

可+1，-1，*2；BFS模板题；