蜜汁RE？

#include<cstdio>
#include<iostream>
#include<queue>
#include<cstring>
using namespace std;
const int maxn = 200001;
int n, k, ans = 0, dist[maxn];
bool vis[maxn];

int pos(int x, int dir){
	return (dir == 2) ? x * 2 : (dir ? x - 1 : x + 1);
}

void bfs(){
	queue<int> q;
	q.push(n);
	vis[n] = 1;
	while (!q.empty()){
		int p = q.front(); q.pop();
		if (p == k)return;
		for (int dir = 0; dir < 3; dir++){
			int newp = pos(p, dir);
			if (!vis[newp] && newp >= 0 && newp <= maxn){
				dist[newp] = dist[p] + 1;
				vis[newp] = 1;
				q.push(newp);
			}
		}
	}
}

int main(){
	int t;
	cin >> t;
	while (t--){
		cin >> n >> k;
		memset(vis, 0, sizeof(vis));
		memset(dist, 0, sizeof(dist));
		bfs();
		printf("%d\n", dist[k]);
	}
}