增强KRM262，增强MG42，增强Q33！

题解：

#include<bits/stdc++.h>
using namespace std;
struct node{
    int x,steps;
};
int a[100210],b,c,n;
bool vis[100210];
bool check(node x){
	return x.x>0 && x.x<=100000 && !vis[x.x];
}
int One_dimensional_breadth_first_search(node start,node end){
	queue<node> q;
	q.push(start);
	while(q.size()){
		node f=q.front();
		q.pop();
		vis[f.x]=1;
		if(f.x==end.x){
			return f.steps; 
		}
		f.steps++;
		node upp={f.x+1,f.steps};
		node down={f.x-1,f.steps};
        node fly={f.x*2,f.steps};
		if(check(upp)){
			q.push(upp);
		}
		if(check(down)){
			q.push(down);
		}
		if(check(fly)){
			q.push(fly);
		}
	}
	return -1;
}
int main(){
	cin>>b>>c;
    cout<<One_dimensional_breadth_first_search({b,0},{c,0});
	return 0;
}