# POJ 3278 Catch That Cow【广度优先搜索】

Catch That Cow
 Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 111610 Accepted: 34874

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

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<queue>
#include<iostream>
#include<algorithm>
using namespace std;
const int MAXN=100005;
int vis[MAXN];
queue<int>q;
int X[3]={0,-1,1};
int bfs(int n,int k)
{
vis[n]=1;
q.push(n);
while(!q.empty())
{
q.pop();
{
}
else
{
for(int i=1;i<3;i++)
{
if(tt>=0&&tt<=1e5&&vis[tt]==0)///如果当前位置没被访问过就入队
{
q.push(tt);
}
if(mm>=0&&mm<=1e5&&vis[mm]==0)
{
q.push(mm);
}
}
}
}

}
int main()
{
int n,k;
while(~scanf("%d %d",&n,&k))
{
memset(vis,0,sizeof(vis));
while(!q.empty()) q.pop();///注意每一次都要判断队列是否为空
int  ans= bfs(n,k);
printf("%d\n",ans-1);///上面模块中起点也计算在其中了，所以这里要减去1.
}
return 0;
}

• 广告
• 抄袭
• 版权
• 政治
• 色情
• 无意义
• 其他

120