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?
Line 1: Two space-separated integers:
N and
K
Line 1: The least amount of time, in minutes, it takes for Farmer John to catch the fugitive cow.
5 17
4
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>
using namespace std;
#include<cstring>
const int N=1e5;
struct node{
int num;
int mm;
node(int num,int mm){
this->num=num;
this->mm=mm;
}
node(){
}
};
bool flag[N*2];
struct node value[N*2];
int last=0;
void bfs(int start,int end){
value[0]=node(start,0);
flag[start]=true;
++last;
for(int i=0;i<last;++i){
int tnum=value[i].num;
int tmm=value[i].mm;
if(tnum==end) {
cout<<tmm;
break;
}
++tmm;
if(!flag[tnum-1]){
value[last++]=node(tnum-1,tmm);
flag[tnum-1]=true;
}
if(tnum+1<=N&&!flag[tnum+1]){
value[last++]=node(tnum+1,tmm);
flag[tnum+1]=true;
}
if(tnum*2<=N&&!flag[tnum*2]){
value[last++]=node(tnum*2,tmm);
flag[tnum*2]=true;
}
}
}
int main(){
int start,end;
cin>>start>>end;
memset(flag,false,sizeof(flag));
bfs(start,end);
}