C - Catch That Cow

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

Inputcopy	Outputcopy
5 17	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.

 

简单bfs

//#include<bits/stdc++.h>
#include <iostream>
#include <cstring>
#include <queue>
#include <algorithm>

using namespace std;
typedef long long ll;
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define INF 0x3f3f3f3f
#define mem(a,b) memset(a,b,sizeof(a));
int n,k;
const int maxx=1e5+5;
bool visited[maxx];
int step[maxx];

void bfs(int n,int k){
    queue<int> q;
    int head,t;
    head=n;
    visited[n]=true;
    q.push(head);
    while(!q.empty()){
        head=q.front();
        q.pop();
        for(int i=0;i<3;i++){
            t=head;
            if(i==0) t+=1;
            else if(i==1) t-=1;
            else t*=2;
            if(t<0||t>maxx) continue;
            if(!visited[t]){
                step[t]=step[head]+1;
                q.push(t);
                visited[t]=true;
            }
            if(t==k){
                cout<<step[t]<<endl;
                return ;
            }
        }
    }
    return ;
}

int main(){
    while(cin>>n>>k){
        mem(visited,0);
        mem(step,0);
        bfs(n,k);
    }
}