hdu 2717 Catch That Cow

Catch That Cow

Time Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 6710    Accepted Submission(s): 2129

Problem 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>
#include<iostream>
#include<string.h>
#define max 10000005

struct node
{
	int x,t;
}p[max];

int a,b,n;
int head,tail;
int k[max];   

void bfs(int a,int b)
{
	head=0;
	tail=0;
	k[a]=1;  
	p[head].x=a;
	p[head].t=0;
	head++;
	while(tail<=head)
	{
		if(p[tail].x==b)
		{
			n=p[tail].t;
			return ;
		}
		else
		{
			if(2*p[tail].x<=100000 && !k[2*p[tail].x])
			{
				p[head].x=2*p[tail].x;
				p[head].t=p[tail].t+1;
				k[p[head].x]=1;
				head++;
			}
			if(p[tail].x+1<=100000 && !k[p[tail].x+1])
			{
				p[head].x=p[tail].x+1;
				p[head].t=p[tail].t+1;
				k[p[head].x]=1;
				head++;
			}
			if(p[tail].x-1<=100000 && !k[p[tail].x-1])
			{
				p[head].x=p[tail].x-1;
				p[head].t=p[tail].t+1;
				k[p[head].x]=1;
				head++;
			}
			tail++;
		}
	}
}
int main ()
{
	
	scanf("%d%d",&a,&b);
	memset(k,0,sizeof(k));
	if(a==b) 
		printf("0\n");
	else 
	{
		n=0;
		bfs(a,b);
		printf("%d\n",n);
	}
	return 0;
}