[kuangbin带你飞]专题一简单搜索C - Catch That Cow(POJ 3278)

最新推荐文章于 2020-06-17 15:59:27 发布

zhaohuc

最新推荐文章于 2020-06-17 15:59:27 发布

阅读量524

点赞数

分类专栏： [kuangbin带你飞]专题一简单搜索 BFS 文章标签：专题一简单搜索

本文链接：https://blog.csdn.net/ZZ_AC/article/details/49748665

版权

[kuangbin带你飞]专题一简单搜索同时被 2 个专栏收录

14 篇文章 0 订阅

订阅专栏

BFS

13 篇文章 0 订阅

订阅专栏

C - Catch That Cow

Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u

Submit Status Practice POJ 3278

Appoint description:

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.

题意：给你两个数n, k。有三种操作

1 n+1

2 n-1

3 n*2

问通过几次操作后n表位

又是类似于最短距离的题，用bfs

当n>k时只能进行2操作。

当n<k时可以进行1,2,3操作（1和3操作好理解为什么可以进行2操作比如5->4->8）

敲代码前一定要把全部情况考虑到位，别漏掉了一些

#include
   
   
    
    
#include
    
    
     
     
#include
     
     
      
      
#include
      
      
       
       
using namespace std;

const int N = 1000001;
int n, m;
int ans = 0;
bool flag[N];
struct node
{
    int x;      //记录数
    int step;   //步数
    node(){}
    node(int xx, int ss)
    {
        x = xx; step = ss;
    }
};

queue
       
       
         que; void solve() { while(!que.empty()) que.pop(); que.push(node(n, 0)); memset(flag, 0, sizeof(flag)); flag[n] = 1; while(!que.empty()) { node tmp = que.front(); que.pop(); if(tmp.x > m)//大于m只能减 { if(tmp.x-1 == m) {ans = tmp.step+1;return;} if(!flag[tmp.x-1]) { que.push(node(tmp.x-1, tmp.step+1)); flag[tmp.x-1] = 1; } } else//小于可以减，可以乘二，可以加一 { if(tmp.x+1 == m || tmp.x*2 == m) {ans = tmp.step+1;return;} if(!flag[tmp.x+1]) { que.push(node(tmp.x+1, tmp.step+1)); flag[tmp.x+1] = 1; } if(tmp.x*2 <= 2*m && !flag[tmp.x*2])//5->10->9 { que.push(node(tmp.x*2, tmp.step+1)); flag[tmp.x*2] = 1; } if(tmp.x-1 >= 0 && !flag[tmp.x-1]) { que.push(node(tmp.x-1, tmp.step+1)); flag[tmp.x-1] = 1; } } } } int main(void) { while(~scanf("%d%d", &n, &m)) { if(n == m) {printf("0\n");continue;} solve(); printf("%d\n", ans); } return 0; }