hdoj2717Catch That Cow

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.
   
   
   
    
  
  

 题意：有两个数n和m，问n变成m至少用几个步骤，有三个步骤（n-1），（n+1），（n*2）

代码如下：

#include<cstdio>  
#include<cstring>  
#include<queue>  
using namespace std;  
#define max 100010   
int vis[max*2];  
  
void bfs(int n,int m)  
{  
    int i,now,end;  
    memset(vis,0,sizeof(vis));  
    queue<int>q;  
    q.push(n);  
    while(!q.empty())  
    {  
        now=q.front();  
        q.pop();  
        if(now==m)  
            break;  
        for(i=0;i<3;++i)  
        {  
            if(i==0)  
                end=now+1;  
            if(i==1)  
                end=now-1;  
            if(i==2)  
                end=now*2;  
            if(end>=0&&end<max&&!vis[end])  
            {  
                vis[end]=vis[now]+1;  
                q.push(end);  
            }  
        }  
    }  
    printf("%d\n",vis[m]);  
}   
  
int main()  
{  
    int n,m;  
    while(scanf("%d%d",&n,&m)!=EOF)  
        bfs(n,m);  
    return 0;  
}