Catch That Cow

最新推荐文章于 2022-01-19 03:53:25 发布

洢嵐0916

最新推荐文章于 2022-01-19 03:53:25 发布

阅读量127

点赞数

分类专栏：数据结构-建图&&遍历

本文链接：https://blog.csdn.net/qwqwdqwqwe/article/details/79207219

版权

数据结构-建图&&遍历专栏收录该内容

18 篇文章 0 订阅

订阅专栏

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?

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.

Example Input

5 17

Example Output

Hint

poj3278 有链接提示的题目请先去链接处提交程序，AC后提交到SDUTOJ中，以便查询存档。
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.

Author

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
const int maxn = 1e5 + 1;
int graph[maxn];
bool visited[maxn];
void BFS(ll N, ll K) {
    queue<int> Q;
    visited[N] = 1;
    graph[N] = 0;
    Q.push(N);
    while(!Q.empty()) {
        int p = Q.front();
        if(p == K) {
            printf("%d\n", graph[p]);
            return;
        }
        Q.pop();
        int q;
        for(int i = 0; i < 3; i++) {
            if(i == 0) {
                q = p + 1;
            } else if(i == 1) {
                q = p - 1;
            } else {
                q = p * 2;
            }
            if(q < 0 || q > 1e5) {
                continue;
            }
            if(!visited[q]) {
                visited[q] = 1;
                graph[q] = graph[p] + 1;
                Q.push(q);
            }

        }
    }
}
int main() {
    ll N, K;
    while(~scanf("%lld%lld", &N, &K)) {
        if(K <= N) {
            printf("%lld\n", N - K);
        } else {
            memset(visited, 0, sizeof(visited));
            BFS(N, K);
        }
    }
    return 0;
}


/***************************************************
User name:
Result: Accepted
Take time: 0ms
Take Memory: 504KB
Submit time: 2018-01-30 15:15:04
****************************************************/