Codeforces Round #295 (Div. 2) B bfs

链接：戳这里

B. Two Buttons

time limit per test2 seconds

memory limit per test256 megabytes

inputstandard input

outputstandard output

Vasya has found a strange device. On the front panel of a device there are: a red button, a blue button and a display showing some positive integer. After clicking the red button, device multiplies the displayed number by two. After clicking the blue button, device subtracts one from the number on the display. If at some point the number stops being positive, the device breaks down. The display can show arbitrarily large numbers. Initially, the display shows number n.

Bob wants to get number m on the display. What minimum number of clicks he has to make in order to achieve this result?

Input
The first and the only line of the input contains two distinct integers n and m (1 ≤ n, m ≤ 104), separated by a space .

Output
Print a single number — the minimum number of times one needs to push the button required to get the number m out of number n.

Examples
input
4 6
output
2
input
10 1
output
9
Note
In the first example you need to push the blue button once, and then push the red button once.

In the second example, doubling the number is unnecessary, so we need to push the blue button nine times.

题意：

给出两个数a,b。要求通过a*2或者a+1到达b。输出最小步数

思路：

bfs搜下去就可以了，然后需要标记一下走过的点

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include <ctime>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<iomanip>
#include<cmath>
#include<bitset>
#define mst(ss,b) memset((ss),(b),sizeof(ss))
///#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
#define INF (1ll<<60)-1
#define Max 1e9
using namespace std;
ll n,m;
struct node{
    ll now,num;
    node(ll now=0,ll num=0):now(now),num(num){}
    bool operator < (const node &a) const{
        return num>a.num;
    }
};
map<ll,int> vis;
void BFS(ll a,ll b){
    priority_queue<node> qu;
    qu.push(node(a,0));
    while(!qu.empty()){
        node t=qu.top();
        qu.pop();
        vis[t.now]=1;
        ///printf("%I64d %I64d\n",t.now,t.num);
        if(t.now==b){
            cout<<t.num<<endl;
            return ;
        }
        if(t.now<b){
            if(!vis[t.now*2]) qu.push(node(t.now*2,t.num+1));
            if(!vis[t.now-1]) qu.push(node(t.now-1,t.num+1));
        } else if(t.now>b){
            if(!vis[t.now-1]) qu.push(node(t.now-1,t.num+1));
        }
    }
}
int main(){
    scanf("%I64d%I64d",&n,&m);
    if(n>m) {
        printf("%I64d\n",n-m);
        return 0;
    }
    BFS(n,m);
    return 0;
}