Catch That Cow （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?

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<iostream>
#include<queue>
#include<cstring>
using namespace std;
struct node{
	int x;
	int step;
};
int vis[100005];
int n,m,ans;
void bfs(){
	queue<node> q;
	node now,next;
	now.x = n,now.step = 0;
	q.push(now);
	vis[now.x] = 1;
	while(q.size()){
		now = q.front();
		if(now.x == m){
			ans = now.step;
			return;
		}
		q.pop();
		next.step = now.step + 1;
		if(now.x * 2 <= 100000 && !vis[now.x * 2]){
			next.x =  now.x * 2;
			q.push(next);
			vis[next.x] = 1;
		}
		if(now.x - 1 >= 0 && !vis[now.x - 1]){
			next.x = now.x - 1;
			q.push(next);
			vis[next.x] = 1;
		}
		if(now.x + 1 < 100005 && !vis[now.x + 1]){
			next.x = now.x + 1;
			q.push(next);
			vis[next.x] = 1;
		}		
	}
}
int main(){
	cin>>n>>m;
	ans = 0;
	bfs();
	cout<<ans<<endl;
	return 0;
}