Catch That Cow

Time Limit: 2000MS	?	Memory Limit: 65536K
Total Submissions: 61826	?	Accepted: 19329

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

USACO 2007 Open Silver

[Submit]?? [Go Back]?? [Status]?? [Discuss]

Home Page ??Go Back??To top

#include<stdio.h> #include<string.h> #include<queue> #include<iostream> #include<algorithm> using namespace std;

轉(zhuǎn)載于:https://www.cnblogs.com/13224ACMer/p/4738717.html

總結(jié)

以上是生活随笔為你收集整理的poj 3278 catch that cow BFS(基础水)的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。