Catch That Cow
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 67577 | Accepted: 21286 |
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
#include <iostream>
using namespace std;
#define max 100001
long n,k,f[max],d[max];
bool visit[max];
void bfs()
{
long head,tail,x,y;
head=tail=0;
d[0]=n;
f[n]=0;
visit[n]=true;
while(head<=tail)
{
x=d[head];
y=x-1;
if(y>=0&&!visit[y])
{
tail++;
d[tail]=y;
f[y]=f[x]+1;
visit[y]=true;
}
y=x+1;
if(y<=max&&!visit[y])
{
tail++;
d[tail]=y;
f[y]=f[x]+1;
visit[y]=true;
}
y=x*2;
if(y<=max&&!visit[y])
{
tail++;
d[tail]=y;
f[y]=f[x]+1;
visit[y]=true;
}
if(visit[k])
break;
head++;
}
}
int main()
{
int i;
cin>>n>>k;
memset(visit,false,sizeof(visit));
bfs();
cout<<f[k]<<endl;
return 0;
}