BFS问题: Catch That Cow

一道BFS问题，找最快使用BFS，到达相应位置立即停止

题目描述

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?

输入

multi test case.

For each test case, contains two space-separated integers: N and K

 

输出

Line 1: The least amount of time, in minutes, it takes for Farmer John to catch the fugitive cow.

样例输入 

5 17
6 18

样例输出

4
4

提示

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 <bits/stdc++.h>
using namespace std;
int n,des;
int visited[100007];
int b[100007];//表示已移动的次数

void BFS(int n,int des){
    //找最快使用BFS，到达相应位置立即停止
    memset(visited,0,sizeof(visited));
    memset(b,0,sizeof(b));
    queue<int> que;
    que.push(n);
    visited[n] = 1;
    b[1] = 0;
    while(!que.empty()){
        int q = que.front();
        que.pop();
        if(q == des){
            cout<<b[q]<<endl;
            return;
        }
        else{
        //走一格
        if(!visited[q + 1]&&q+1>=0&&q +1 <= 100000){
            visited[q + 1] =1;
            b[q+1] = b[q] + 1;
            que.push(q+1);
        }
        //退一格
        if(!visited[q - 1]&&q-1>=0&&q -1 <=100000){
            visited[q-1] =1;
            b[q-1] = b[q] + 1;
            que.push(q-1);
        }
        //传送
        if(!visited[q*2]&&q*2>=0&&q*2 <= 100000){
            visited[q * 2] =1;
            b[q*2] = b[q] + 1;
            que.push(q*2);
            }
        }
    }
}
int main()
{
    while(cin>>n>>des){
        BFS(n,des);
    }
}