POJ 3278 Catch That Cow (BFS)

Catch That Cow

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 46662		Accepted: 14654

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.

Source

USACO 2007 Open Silver

#include <stdio.h>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <ctime>
#define MAXN  100001

using namespace std;
typedef long long LL;


int v[MAXN],r[MAXN]; 
queue<int> q;
int BFS(int a,int b){
	if(a == b)return 0;
	q.push(a);
	
	int num;
	while(!q.empty()){
		num = q.front();
		q.pop();
	if(num + 1<MAXN && !v[num+1]){
		q.push(num+1);
		r[num+1] = r[num]+1;
		v[num+1] = 1;
	}
	
	if(num + 1 == b)break;
	
	if(num - 1>=0 && !v[num-1]){
		q.push(num-1);
		r[num-1] = r[num]+1;
		v[num-1] = 1;
	}
	
	if(num - 1 == b)break;
	
		if(num * 2 <MAXN && !v[num*2]){
		q.push(num*2);
		r[num*2] = r[num]+1;
		v[num*2] = 1;
	}
	
	if(num *2 == b)break;
	}
	return r[b];
}
int main() {
	int a,b;
	//int n,m,k;
	while(scanf("%d%d",&a,&b)!=EOF){
	int sum = BFS(a,b);
	printf("%d\n",sum);
	}
	return 0;
}