# poj 3278 Catch That Cow （BFS+剪枝）

258人阅读 评论(0)

Catch That Cow
 Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 58474 Accepted: 18173

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 - 1 or + 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 <queue>
using namespace std;
const int maxn=200010;
int m,n;
int vis1[maxn];
struct node
{
int x,step;
};
int bfs()
{
node sd;
sd.x=n;
sd.step=0;
queue<node>q;
q.push(sd);
while(!q.empty())
{
node nd=q.front();
if(nd.x==m)
return nd.step;
q.pop();
for(int i=0;i<3;i++)//枚举三种变换方法
{
if(i==0)
{
sd.x=nd.x-1;
sd.step=nd.step+1;
if(sd.x>=0&&!vis1[sd.x])  //该数字没有访问过，可加入队列
{
vis1[sd.x]=1;
q.push(sd);
}
}
else if(i==1)
{
sd.x=nd.x+1;
sd.step=nd.step+1;
if(sd.x>maxn)         //超出最大范围的数字舍去
continue;
if(sd.x>=0&&!vis1[sd.x])
{
vis1[sd.x]=1;
q.push(sd);
}
}
else
{
sd.x=nd.x*2;
sd.step=nd.step+1;
if(sd.x>maxn)
continue;
if(sd.x>=0&&!vis1[sd.x])
{
vis1[sd.x]=1;
q.push(sd);
}
}
}
}

}
int main()
{
scanf("%d%d",&n,&m);
printf("%d\n",bfs() );
return 0;
}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：48989次
• 积分：1987
• 等级：
• 排名：第19609名
• 原创：160篇
• 转载：0篇
• 译文：0篇
• 评论：4条