0分，求大佬

#include<bits/stdc++.h>
using namespace std;
bool c[1000005];
struct N{
    int x,step;
};
int main(){
    int t;cin>>t;
    int x,y;cin>>x>>y;
    while(t--){
        memset(c,0,sizeof(c));
        queue<N>q;
        cin>>x>>y;
        c[x]=1;
        q.push({x,0});
        while(!q.empty()){
            N cur=q.front();
            q.pop();
            if(cur.x==y){
                cout<<cur.step;
                break;
            }
            if(cur.x-1>=1e5&&c[cur.x-1]==0){
              c[cur.x-1]=1;
                q.push({cur.x-1,cur.step+1});
            }
                if(cur.x+1<=1e5&&c[cur.x+1]==0){
                    c[cur.x+1]=1;
                    q.push({cur.x+1,cur.step+1});
            }
                if(cur.x*2<=1e5&&c[cur.x*2]==0){
                    c[cur.x*2]=1;
                    q.push({cur.x*2,cur.step+1});
           }
        }
    }
    return 0;
}