POJ 3278 Catch That Cow
来源:互联网 发布:vb编写计算器程序 编辑:程序博客网 时间:2024/05/26 14:09
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
Output
Sample Input
5 17
Sample Output
4
Hint
题目大意 有一个人在找自己的奶牛,他和奶牛在一条直线的路上,他的位置是N奶牛的位置是K,他每分钟可以进行一个操作,1.向前走一步,2.向后走一步,3.往前面跳到自己当前位置两倍的位置,问最少多分钟找到自己的奶牛。
思路 裸BFS
#include<iostream>#include<cstdio>#include<cstring>#include<cstdlib>#include<cmath>#include<algorithm>using namespace std;#define inf 0xffffff#define maxn 100005int Map[maxn];int q[maxn],t1,t2;int main(){ int s,e,ans; while(cin>>s>>e){ memset(Map,0,sizeof(Map)); t1 = t2 = 0; q[t2++] = s; Map[s] = 1; while(s != e){ s = q[t1++]; if(s*2 < maxn && !Map[s*2]) {Map[s*2] = Map[s] + 1; q[t2++] = s * 2;} if(s+1 < maxn && !Map[s+1]) {Map[s+1] = Map[s] + 1; q[t2++] = s + 1;} if(s-1 >= 0 && !Map[s-1]) {Map[s-1] = Map[s] + 1; q[t2++] = s - 1;} } cout<<Map[e] - 1<<endl; } return 0;}
- poj 3278 Catch That Cow
- POJ 3278 Catch That Cow
- poj 3278 catch that cow
- poj 3278 Catch That Cow
- POJ 3278 Catch That Cow
- Poj 3278 Catch That Cow
- POJ 3278 Catch That Cow
- POJ 3278 Catch That Cow
- POJ 3278 Catch That Cow
- poj 3278 Catch That Cow
- POJ 3278 Catch That Cow
- poj 3278 Catch That Cow
- poj 3278 Catch That Cow
- POJ 3278 Catch That Cow
- POJ 3278 - Catch That Cow
- POJ 3278 Catch That Cow
- POJ 3278 Catch That Cow
- POJ-3278-Catch That Cow
- 【五校联考2015 9.13】池塘
- mysql连接字符串正确方法
- 怎么使用iperf来测量wifi吞吐量
- Bash 实例
- Android使用ViewPager实现引导页(带小点提示)
- POJ 3278 Catch That Cow
- linux常用命令(29):chmod命令命令
- 共享i
- Android中TrafficStats流量监控类
- 正则表达式
- BZOJ 1113 [Poi2008]海报PLA 单调栈
- leetcode Same Tree
- ubuntu下面编译c或者c++文件
- 全局变量,全局静态变量,局部静态变量,局部变量