牛客网__Catch That Cow

链接：https://ac.nowcoder.com/acm/contest/984/L
来源：牛客网
 

时间限制：C/C++ 1秒，其他语言2秒
空间限制：C/C++ 32768K，其他语言65536K
64bit IO Format: %lld

题目描述

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?

输入描述:

Line 1: Two space-separated integers: N and K

输出描述:

Line 1: The least amount of time, in minutes, it takes for Farmer John to catch the fugitive cow.

示例1

输入

复制

5 17

输出

复制

4

说明

Farmer John starts at point 5 and the fugitive cow is at point 17.
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.

本来以为是什么dp，看了一眼数据范围，发现就是一个宽搜

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int maxn = 2e6+9;
const int mod = 1e9+7;
const int INF = 0x3f3f3f3f;

int n,m;

int dis[maxn];

void bfs(int u){
    dis[u]=1;
    queue<int>que;
    que.push(u);
    while(!que.empty()){
        int p=que.front(); que.pop();
//        cout<<p<<" "<<dis[p]<<endl;
        if(p==m)break;
        if(p<m){
            if(!dis[p+1]){
                dis[p+1]=dis[p]+1;
                que.push(p+1);
            }
            if(!dis[p*2]){
                dis[p*2]=dis[p]+1;
                que.push(p*2);
            }
            if(p>0&&!dis[p-1]){
                dis[p-1]=dis[p]+1;
                que.push(p-1);
            }
        }
        else{
            if(!dis[p-1]){
                dis[p-1]=dis[p]+1;
                que.push(p-1);
            }
        }
    }
}

int main(){
    scanf("%d%d",&n,&m);
    bfs(n);
//    cout<<dis[m]<<endl;
    printf("%d\n",dis[m]-1);
    return 0;
}