Codeforces 520B Two Buttons 【BFS】||【spfa】

B. Two Buttons

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard 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.

Sample test(s)

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.

题意：有一种装置，有两种运算方式，在原来的基础上 乘2或者是-1. 给你两个数字问将第一个数字转化为第二个数字需要几次。

分析：当做一个隐式图来枚举。bfs与spfa都可以。

代码1：（BFS）

#include <iostream>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>

using namespace std;
const int Max = 2e4+4;
const int Min = 0;

typedef struct {  //BFS
    int num;
    int step;
}node;

bool vis[Max+5];

void bfs(int n, int m){
    //const int nn = n-n/2;
    //const int mm = m + m/2;
    queue <node> q;
    memset(vis, false, sizeof(vis));
    vis[n] = 1;
    node st;
    st.num = n; st.step = 0;
    q.push(st);
    while(!q.empty()){
        node temp = q.front();
        q.pop();
        node cur1, cur2;
        cur1 = cur2 = temp;
        cur1.num *= 2; cur1.step ++;
        cur2.num -= 1; cur2.step ++;
        if(cur1.num == m){
            cout << cur1.step; break;
        }
        if(cur2.num == m){
            cout << cur2.step; break;
        }
        //if(cur1.num > nn&& cur1.num < mm)
        //if(cur1.num > Min && cur.num < M)
        if(cur1.num > 0&&cur1.num < Max&&!vis[cur1.num]){
            q.push(cur1);
            vis[cur1.num] = 1;
        }
        //if(cur2.num > nn && cur2.num < mm)
        if(cur2.num > 0&&cur2.num < Max&&!vis[cur2.num]){  //终止点
            q.push(cur2);
            vis[cur2.num] = 1;
        }
     }
}

int main(){
    int n, m, c = 0;
    cin >> n >>m;
    if(m < n){
        cout << n-m <<endl;
        return 0;
    }
    else if(m == n){
        cout << 0<<endl;
        return 0;
    }
    else{
        bfs(n, m);
    }
    return 0;
}

代码2：（spfa）

#include <iostream>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>

using namespace std;
const int Max = 2e4+4;
const int Min = 0;

struct node{
    int to, next;
}edges[Max*4];
int di[Max], head[Max], tot;  //用链式前项星
bool vis[Max]; 

void init(){  //初始化
    tot = 0;memset(head, -1, sizeof(head));
}

void addv(int a, int b){  //添加
    edges[tot].to = b;
    edges[tot].next = head[a];
    head[a] = tot++;
}

void spfa(int n, int m){
    memset(di, 'a', sizeof(di));
    memset(vis, false, sizeof(vis));
    int c[Max];
    memset(c, 0, sizeof(c));
    di[n] = 0;
    vis[m] = 1;
    vis[n] = 1;
    c[n] = 1;
    queue<int> q;
    q.push(n);
    while(!q.empty()){  //很类似BFS
        int temp = q.front();
        q.pop();
        for(int i = head[temp]; ~i; i = edges[i].next){
            int v = edges[i].to;
            if(di[v] > di[temp]+1){
                di[v] = di[temp]+1;
                if(!vis[v]){
                    q.push(v);
                    //if()
                    //c[v]++;
                    //if(c[v] >= Max) return ;
                    vis[v] = 1;
                }
            }
        }
        vis[temp] = 0;
    }

}

int main(){ //spfa
    int n, m, c = 0;
    cin >> n >>m;
    if(m < n){
        cout << n-m <<endl;
        return 0;
    }
    else if(m == n){
        cout << 0<<endl;
        return 0;
    }
    else{
		init();
        for(int i = 1; i < 10005; i++){  //先将所有的可能的运算构成一个隐式图.
            if(i*2 < Max) addv(i, i*2);
            if(i-1 > 0) addv(i, i-1);
        }
       // cout <<" dcd";
        
        spfa(n, m);
        cout <<di[m]<<endl;
    }
    return 0;
}