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 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.

问题分析

    这道题是一道经典的广搜的题，由于只有三种走法，分步广搜即可。这里我用到了STL里面的queue。（STL真是好东西，用好了可以简化很多操作）。

    注意两个细节：

    最大的距离不能够超过所给数据范围的2倍。因为一旦超过，就一定不是最少步数的走法（不明白的读者可以自己推导一下）。

    人和牛可能在0号点，这就要求越界判断更加严谨（笔者就是这里错误了几次）。

代码如下

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cstring>
#include <queue>
using namespace std;
const int MAX = 200000 + 5;//最大不超过100000的2倍 

bool mark[MAX];//用来判断该点走过与否 
int N, K;
struct Node{
	int place, step; //分别表示农夫的位置和已经走的步数 
};

bool exist(int x)//判断是否符合要求（没有越界，没有走过） 
{
	if(x > -1 && x < MAX && !mark[x])//仔细看题，不难发现，牛可能在0点，因此x>-1，严谨的保证正确 
		return 1;
	return 0;
}

int BFS()
{
	queue<Node> Q;
	Node here, next;
	here.place = N;
	here.step = 0;
	mark[here.place] = true;
	Q.push(here);
	while(!Q.empty()){
		here = Q.front();
		Q.pop();
		if(here.place == K)//农夫找到了牛 
			return here.step;
		next = here;
		//开始分情况讨论 
		next.place = here.place + 1;
		if(exist(next.place)){
			next.step = here.step + 1;//步数加1 
			mark[next.place] = true;//已经走过 
			Q.push(next);
		}
		next.place = here.place - 1;
		if(exist(next.place)){
			next.step = here.step + 1;
			mark[next.place] = true;
			Q.push(next);
		}
		next.place = here.place * 2;
		if(exist(next.place)){
			next.step = here.step + 1;
			mark[next.place] = true;
			Q.push(next);
		}
	}
}

int main()
{
	while(scanf("%d%d", &N, &K) != EOF){
		memset(mark, false ,sizeof(mark));
		printf("%d\n", BFS());
	}
	return 0;
}