codeforces 520B Two Buttons[记忆化搜索]

最新推荐文章于 2021-12-08 20:14:28 发布

skyqinsc

最新推荐文章于 2021-12-08 20:14:28 发布

阅读量800

点赞数

分类专栏： ACM

本文链接：https://blog.csdn.net/code_or_code/article/details/44225553

版权

ACM 专栏收录该内容

145 篇文章 0 订阅

订阅专栏

Vasya发现了一个设备，红按钮使显示数翻倍，蓝按钮减一，目标是将初始数n变为m。问题是求达到m所需的最小点击次数。输入包含两个不同整数n和m(1≤n,m≤104)。输出为最小点击次数。" 107709423,7365110,HBase高效删除指定列族和列,"['hbase', '数据库操作', '数据清理']

摘要由CSDN通过智能技术生成

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 ≤ 10⁴), 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

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<map>
#define INF 0x3f3f3f3f
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;

typedef long long LL;
const int N=100007;

struct node{
    int cnt;
    int cur;
    node(int a,int b):cnt(a),cur(b){}
};

int vis[N];


void bfs(int n,int m)
{
    mem(vis,0);
    queue<node> que;
    que.push(node(0,n));
    vis[n]=1;
    while(!que.empty())
    {
        node cc=que.front();
        que.pop();
        if(cc.cur==m)
        {
            printf("%d\n",cc.cnt);
            break;
        }
        if(cc.cur-1>0&&!vis[cc.cur-1])
        {
            que.push(node(cc.cnt+1,cc.cur-1));
            vis[cc.cur-1]=1;
        }
        if(cc.cur*2<2*m&&!vis[cc.cur*2])
        {
            que.push(node(cc.cnt+1,cc.cur*2));
            vis[cc.cur*2]=1;
        }

    }
}

int main()
{
    int n,m;
    while(cin>>n>>m)
    {
        bfs(n,m);
    }
    return 0;
}