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): 9369    Accepted Submission(s): 2938

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


   
   

    
    //解题思路：主要是把三种路径全部压缩到队列中去，最先找到的路径应该是最短的，参考代码如下：
   
   
   
   

    
    
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<queue>
using namespace std;
#define  N 1000000
int vis[N+10];
int n,k;
struct node
{
	int x,step;	  
} a,b;
int jud(int x)  
{  
    if(x<0 || x>=N || vis[x])  
        return 0;  
      return 1;  
}  

int bfs(int x)
{   
     memset(vis,0,sizeof(vis));
     queue<node>q;
	  a.x=x;
	 a.step=0;
	 vis[x]=1;
	  q.push(a);
	 while(!q.empty())
	  {    
	  	   a=q.front();
		   q.pop();
		   if(a.x==k)
	       return a.step;
	       //  b=a;
	  	  b.x=a.x+1;
		  if(jud(b.x))
		   {  
		      b.step=a.step+1;
			  vis[b.x]=1;
			  q.push(b);        
		   } 
		     b.x=a.x-1;
		   if(jud(b.x))
		   {  
		      b.step=a.step+1;
			  vis[b.x]=1;
			  q.push(b);        
		   } 
		    b.x=a.x*2;
		   if(jud(b.x))
		   {  
		      b.step=a.step+1;
			  vis[b.x]=1;
			  q.push(b);        
		   }	  	  
	  }	
	  return -1;  
}
int main(){
	  int ans;
	while(~scanf("%d%d",&n,&k))
	{  
		 ans=bfs(n);
		 printf("%d\n",ans);
		   
	}
		
	return 0;
}