HLG Catch The Cow
来源:互联网 发布:想学网络推广 编辑:程序博客网 时间:2024/05/22 18:22
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?
For each test case :
Line 1: Two space-separated integers: N and K
Process to the end of file.
OutputFor each test case :
Line 1: The least amount of time, in minutes, it takes for Farmer John to catch the fugitive cow.
Sample Input5 17100 100Sample Output4
0
#include <iostream>
#include <string.h>
#include <stdio.h>
#define maxn 200000 + 10
using namespace std;
int que[maxn];
int vis[maxn];
int bfs( int start, int end)
{
int front = 0, back = 0, now;
que[back++] = start;
vis[start] = 0;
while(front <= back)
{
now = que[front++];
if(now == end)
break;
if(now+1 >= 0 && now +1 < maxn && vis[now+1] == -1)
{
vis[now+1] = vis[now] + 1;
que[back++] = now + 1;
}
if(now-1 >= 0 && now -1 < maxn && vis[now-1] == -1)
{
vis[now - 1] = vis[now] + 1;
que[back++] = now - 1;
}
if(now*2 >= 0 && now *2 < maxn && vis[now*2] == -1)
{
vis[now *2] = vis[now] + 1;
que[back++] = now * 2;
}
}
return vis[end];
}
int main()
{
int n,k;
while(cin>>n>>k)
{
memset(vis,-1,sizeof(vis));
cout<<bfs(n,k)<<endl;
}
}
- HLG Catch The Cow
- HLG 1012 Catch that cow (广搜)
- 重做catch the cow
- Catch The Cow
- catch the cow (P3278)
- openjudge2971 catch the cow
- POJ 3278 Catch The Cow
- poj 3278 catch the cow
- catch the cow(简单题)
- toj2825 catch the cow BFS典型题
- catch the cow 抓住小黄牛
- POJ-3278 Catch the cow(BFS)
- catch the cow(poj-3728)
- poj 3728 catch the cow (bfs)广搜
- HLG 1375 The Active Leyni
- POJ3278 Catch That Cow
- Catch That Cow
- Catch That Cow
- php实现三级导航栏效果
- 布线问题
- 0-1背包-poj-1948-Triangular Pastures
- 什么是字符串常量池?
- Make a change
- HLG Catch The Cow
- 个人站点说明
- poj1664 放苹果(递归)
- 讲述自己的心理2。——sox_ck
- OpenMP编程->入门
- AutomationException: 0x80040220
- close与RST
- 王建硕的2001交大Microsoft Club宣讲会
- java中的内部接口