HDU 2717Catch That Cow
来源:互联网 发布:主流的c语言开发工具 编辑:程序博客网 时间:2024/06/08 02:52
Catch That Cow
Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11019 Accepted Submission(s): 3429
Problem 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?
* 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
4HintThe 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
Recommend
teddy | We have carefully selected several similar problems for you: 2102 1372 1240 1072 1180
用广搜把所有走法遍历一遍
#include<stdio.h>#include<string.h>#include<queue>#include<algorithm>#define max 100010using namespace std;int step[2*max];void bfs(int n,int m){int now,next,i;memset(step,0,sizeof(step));queue<int>q;q.push(n);while(!q.empty()){now=q.front();q.pop();if(now==m)break;for(i=0;i<3;i++){if(i==0)next=now+1;if(i==1)next=now-1;if(i==2)next=now*2;if(next>=0&&next<max&&!step[next]) {step[next]=step[now]+1;q.push(next);}}}}int main(){int n,m;while(scanf("%d%d",&n,&m)!=EOF){bfs(n,m);printf("%d\n",step[m]);}return 0;}
0 1
- hdu 2717 Catch That Cow
- HDU-2717-Catch That Cow
- HDU 2717 Catch That Cow
- hdu 2717Catch That Cow
- hdu 2717 Catch That Cow
- HDU-2717-Catch That Cow
- hdu 2717 Catch That Cow
- hdu 2717 Catch That Cow
- HDU 2717 Catch That Cow
- hdu 2717 Catch That Cow
- hdu 2717 Catch That Cow
- HDU 2717 Catch That Cow
- HDU 2717 Catch That Cow
- hdu 2717 Catch That Cow
- HDU 2717Catch That Cow
- HDU 2717 Catch That Cow
- hdu 2717 Catch That Cow
- hdu 2717 Catch That Cow
- 待整理
- 初始mybatis (mybatis开发环境的搭建)
- 线性表的简单操作 置乱 测序
- C语言结构指针详解
- LeetCode#105. Construct Binary Tree from Preorder and Inorder Traversal
- HDU 2717Catch That Cow
- 继承时类修饰符的秘密
- Python学习笔记1-基础语法
- php基础
- Redis for Windows
- ArrayList源码分析
- HDUOJ2553-N皇后问题
- logging的使用
- 第四周项目(3)-随机数函数应用于游戏