poj 3278 Catch That Cow

最新推荐文章于 2024-09-04 11:33:10 发布

saruka_

最新推荐文章于 2024-09-04 11:33:10 发布

阅读量185

点赞数

分类专栏： poj BFS 文章标签： poj BFS

本文链接：https://blog.csdn.net/qq_33692396/article/details/52563633

版权

poj 同时被 2 个专栏收录

4 篇文章 0 订阅

订阅专栏

BFS

1 篇文章 0 订阅

订阅专栏

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

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

/*
Problem: 3278  User: saruka 
Memory: 1000K  Time: 79MS 
Language: C++  Result: Accepted 
*/
#include <iostream>  
#include <queue>  
#include<cstdio>
#include<cstring>
#include<string>
#include<iomanip>
#include<algorithm>
#include<cmath>
#include<cstdlib>
using namespace std;
const int SIZE = 100001;
queue<int> q;
bool vis[SIZE];
int step[SIZE];
int bfs(int n, int k)
{
    int head, next;
    q.push(n);
    vis[n] = true; 
    step[n] = 0; 
    while (!q.empty())
    {
        head = q.front();  
        q.pop();
        for (int i = 0; i < 3; i++)                     
        {
            if (i == 0) next = head - 1;
            else if (i == 1) next = head + 1;
            else next = head * 2;
            if (next > SIZE || next < 0 || vis[next]) continue;
            if (!vis[next])
            {
                q.push(next); 
                step[next] = step[head] + 1; // 前一条路径数目，对应的走过的路程，即为当前的路程数
                vis[next] = true;
            }
            if (next == k) return step[next]; // 广搜的特性，返回的第一个一定是最短的路径
        }
    }
}
int main()
{
    int n, k;
    cin >> n >> k;
    if (n >= k) cout << n - k << endl;
    else cout << bfs(n, k) << endl;
    return 0;
}