Catch That Cow

A - Catch That Cow

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

Submit  Status

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<queue>
using namespace std;
struct node{
    int x,num;
};
const int N=100005;
int d;
bool visited[N];
int BFS(int v){
    queue<node>q;
    node ans,p;
    int x;
    ans.x=v; ans.num=0;
    visited[v]=true;
    q.push(ans);
    while(!q.empty()){
          p=q.front();
          q.pop();
          x=p.x-1;
          if(x<0 || x>N);
          else if(!visited[x]){
              visited[x]=true;
              ans.x=x;
              ans.num=p.num+1;
              q.push(ans);
              if(ans.x==d)  
                 return ans.num;
          }  
          x=p.x+1; 
           if(x<0 || x>N);
          else if(!visited[x]){
              visited[x]=true;
              ans.x=x;
              ans.num=p.num+1;
              q.push(ans);
              if(ans.x==d)  
                 return ans.num;
          }  
          x=2*p.x;
           if(x<0 || x>N);
          else if(!visited[x]){
              visited[x]=true;
              ans.x=x;
              ans.num=p.num+1;
              q.push(ans);
              if(ans.x==d)  
                 return ans.num;
          }             
                     
    }
    
}
int main(){
    int s;
    while(cin>>s>>d){
         if(s==d){
            cout<<0<<endl;
            continue;
         }           
         memset(visited,false,sizeof(visited));    
         cout<<BFS(s)<<endl;
    }
    //system("pause");
    return 0;
}