HDOJ 2717 Catch That Cow （BFS）

Catch That Cow

Time Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 10257    Accepted Submission(s): 3201

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 <cstdio>
#include <iostream>
#include <cstring>
#include <queue>

using namespace std;

int sign[100005], t[100005];
int x, y;

void bfs(){
    memset(sign, 0, sizeof(sign));
    memset(t, 0, sizeof(t));
    queue<int > q;
    q.push(x);
    sign[x] = 1;
    t[x] = 0;
    while (!q.empty()){
        int d = q.front();
        q.pop();
        if (d == y) return;
        int v;
        for (int i = 1; i <= 3; i++){
            if (i == 1) v = d + 1;
            else if (i == 2) v = d - 1;
            else if (i == 3) v = d * 2;
            if (v >= 0 && v < 100005 && sign[v] == 0){
                q.push(v);
                t[v] = t[d] + 1;
                sign[v] = 1;
            }
        }
    }
}

int main(){
    while (~scanf("%d%d", &x, &y)){
        bfs();
        printf("%d\n", t[y]);
    }
    return 0;
}