求助站外题

#include<bits/stdc++.h>
using namespace std;
struct node{
	int di;
};
int n;
int k[100000]; 
int ans[100000];
bool jc(int aa){
	if(ans[aa]>0)return 0;
	if(aa<0||aa>100000)return 0;
	return 1;
}
int a,b;
void wwd(int x){
	queue<node>q;
	node ay;
	ay.di=x;
	q.push(ay);
	ans[x]=1;
	while(q.empty()==0){
		int as;
		as=q.front().di;
		int ae;
		ae=as-1;
		if(jc(ae)){
			ans[ae]=ans[as]+1;
			node by;
			by.di=ae;
			q.push(by);
		}
		if(ae==b){
			cout<<ans[ae]-1;
			return ;
		}
		ae=as+1;
		if(jc(ae)){
			ans[ae]=ans[as]+1;
			node by;
			by.di=ae;
			q.push(by);
		}
		if(ae==b){
			cout<<ans[ae]-1;
			return ;
		}
		ae=as*2;
		if(jc(ae)){
			ans[ae]=ans[as]+1;
			node by;
			by.di=ae;
			q.push(by);
		}
		if(ae==b){
			cout<<ans[ae]-1;
			return ;
		}
		q.pop();
	}
}
int main(){

	cin>>a>>b;
	if(a==b){
		cout<<0;
		return 0;
	}
	wwd(a);
	return 0;
}