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>
#define max 5000030
typedef struct{
int x;
int step;
}node;
int f,r;
int n,k;
node queue[max];
int vis[max];
int BFS(){
int i;
node tmp,tmp1;
tmp.x=n;
tmp.step=0;
queue[r++]=tmp;
vis[n]=1;
while(f<r){
tmp=queue[f++];
for(i=0;i<3;++i){
if(i==0)
tmp1.x=tmp.x+1;
else if(i==1)
tmp1.x=tmp.x-1;
else
tmp1.x=2*tmp.x;
if(tmp1.x>=0&&tmp1.x<=100000&&!vis[tmp1.x]){
if(tmp1.x==k)
return tmp.step+1;
else{
tmp1.step=tmp.step+1;
vis[tmp1.x]=1;
queue[r++]=tmp1;
}
}
}
}
return 0;
}
int main(){
scanf("%d%d",&n,&k);
int num=BFS();
printf("%d\n",num);
return 0;
}