POJ 3278 Catch That Cow

Catch That Cow

https://vjudge.net/problem/POJ-3278
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.

C++

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>

using namespace std;

int n, k;
bool vis[100005];

struct node{
	int num, step;
};

bool judge(int x)
{
	return x >= 0 && x <= 100000 ;
}

int bfs()
{
	queue<node> q;
	node now, next;
	now.num = n;
	vis[n] = true;
	now.step = 0;
	q.push(now);
	while(!q.empty())
	{
		now = q.front();
		q.pop(); 
		if(now.num == k){
			return now.step;
		}
		next.step = now.step + 1;
		next.num = now.num - 1;
		if(judge(next.num) && !vis[next.num]){
			vis[next.num] = true;
			q.push(next);
		}
		next.num = now.num + 1;
		if(judge(next.num) && !vis[next.num]){
			vis[next.num] = true;
			q.push(next);
		}
		next.num = now.num * 2;
		if(judge(next.num) && !vis[next.num]){
			vis[next.num] = true;
			q.push(next);
		}
	}
}

int main()
{
	scanf("%d%d", &n, &k);
	int ans = bfs();
	printf("%d\n", ans);
	return 0;
}