poj-3278 catch the cow

Catch That Cow

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 107277		Accepted: 33541

Description

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<algorithm>
#include<queue>
#include<cstring>
using namespace std;
#define maxn 100010
int n, k;
int visit[maxn];      //数组大于1000必须放在main外面，否则很容易超！！！
struct node
{
	int x;
	int step;
	node(int x, int step) :x(x), step(step) {}
};
int main()
{
	cin >> n >> k;
	memset(visit, 0, sizeof(visit));
	queue<node>q;
	q.push(node(n,0));
	visit[n] = 1;
	while (!q.empty())
	{
		node p = q.front();
		if (p.x == k)
		{
			cout << p.step << endl;
			return 0;
		}
		else
		{
			if (p.x >=0 && !visit[p.x-1])
			{
				q.push(node(p.x-1,p.step+1));   //p.x和p.step
				visit[p.x-1] = 1;
			}
			if (p.x < maxn && !visit[p.x+1])
			{
				q.push(node(p.x + 1, p.step + 1));
				visit[p.x+1] = 1;
			}
			if (p.x * 2 <= maxn && !visit[p.x * 2])
			{
				q.push(node(p.x * 2, p.step + 1));
				visit[p.x * 2] = 1;
			}
			q.pop();
		}
	}
	return 0;
}