poj_3278_Catch That Cow_201407241728

Catch That Cow

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 45959		Accepted: 14400

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

经过+1，-1，*2的操作，使第一个数等于第二个数

求最少步骤都是用的广搜

#include <stdio.h>
#include <string.h>
#include <queue>

using namespace std;

const int MAXN = 100010;

int vis[MAXN],step[MAXN];
int n,k;
queue<int> q;

int bfs(int n,int k)
{
	int i,head,next;	
	step[n]=0;
	vis[n]=1;
	q.push(n);
	while(!q.empty())
	{
		head=q.front();
		q.pop();
		for(i=0;i<3;i++)
		{
			if(i==0)
			next=head-1;
			else if(i==1)
			next=head+1;
			else
			next=head*2;
			if(next>MAXN||next<0)
			continue;
			if(!vis[next])
			{
				vis[next]=1;
				q.push(next);
				step[next]=step[head]+1;
			}
			if(k==next)
			return step[next];
		}
	}	
}
int main()
{	
	while(scanf("%d%d",&n,&k)!=EOF)
	{
		memset(vis,0,sizeof(vis));
		if(n>=k)
		printf("%d\n",n-k);
		else
		printf("%d\n",bfs(n,k));
	}
	return 0;
}