Catch That Cow 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.

代码：

#include<iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <functional>
#include <ctime>
#include <iomanip>
#include <sstream>
#include <algorithm>
#define ll long long
#define PI acos(-1)
#define mes(x,y) memset(x,y,sizeof(x))
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
const ll INF = 1e9 + 10;
ll n, m, k, i, j, x, y;
string s;
ll mm[200000];
int main() {
	FAST_IO;
	while (cin >> n >> m) {
		queue<ll>que;
		mes(mm, 0);
		mm[n] = 1;
		que.push(n);
		while (!que.empty()) {
			x = que.front(); que.pop();
			if (mm[m] != 0) {
				cout << mm[m] - 1 << endl;
				break;
			}
			if (mm[x - 1] == 0 && x - 1 >= 0 && x - 1 <= 100000) {
				que.push(x - 1);
				mm[x - 1] = mm[x] + 1;
			}
			if (mm[x + 1] == 0 && x + 1 >= 0 && x + 1 <= 100000) {
				que.push(x + 1);
				mm[x + 1] = mm[x] + 1;
			}
			if (mm[x * 2] == 0 && x * 2 >= 0 && x * 2 <= 100000) {
				que.push(x * 2);
				mm[x * 2] = mm[x] + 1;
			}
		}

	}
}