【POJ3278】Catch That Cow

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

求解最佳方案，故用BFS

//Matsuri
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<queue>
#define MAXN 200001
using namespace std;
int n,k,ans;bool vis[MAXN];
typedef struct
{
	int p; //该点位置 
	int t; //到该点已花费时间 
}node;
queue<node>q;

node transmod(node c,int num)
{
	node tmp;
	if (num==1)
	{
		tmp.p=c.p+1;
		tmp.t=c.t+1;
	}
	if (num==2)
	{
		tmp.p=c.p-1;
		tmp.t=c.t+1;
	}
	if (num==3)
	{
		tmp.p=c.p<<1;
		tmp.t=c.t+1;
	}
	return tmp;
}
void solve(node sp,node ep)
{
	node cur,next;
	
	q.push(sp);
	vis[sp.p]=1;
	while(!q.empty())
	{
		cur=q.front();q.pop();
		if (cur.p==ep.p) //抓到奶牛了 
		{
			ans=cur.t;
			break;
		}
		else
		{
			for (int i=1;i<=3;i++)
			{
				next=transmod(cur,i);
				if (!vis[next.p] && next.p>=0 && next.p<=100000)
				{
					q.push(next);
					vis[next.p]=1;	
				} 
			}	
		}
	}
}
int main()
{
	while(scanf("%d%d",&n,&k)!=EOF)
	{
		memset(vis,0,sizeof(vis));
		while(!q.empty()) q.pop();
		node s,e; //起止点 
		s.p=n;s.t=0;
		e.p=k;
		solve(s,e);
		printf("%d\n",ans);
	}
	return 0;
}