#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9, C = 30;
int H[100000];
bool odd[100000];
vector<int> u_times[100000];
vector<vector<int>> trust[100000];
vector<vector<pair<int, int>>> updates[100000];
void init(int N, int D, int H[]) {
for (int i = 0; i < N; i++) {
trust[i].push_back({});
updates[i].push_back({});
u_times[i].push_back(0);
::H[i] = H[i];
}
}
vector<int> playback(int shaman, int time) {
int idx = upper_bound(u_times[shaman].begin(), u_times[shaman].end(), time) - u_times[shaman].begin() - 1;
vector<int> v = trust[shaman][idx];
vector<pair<int, int>> u = updates[shaman][idx];
for (int i : v) odd[i] ^= 1;
for (pair<int, int> i : u) {
if (i.first >= time) break;
odd[i.second] ^= 1;
}
vector<int> ret;
for (int i : v) if (odd[i]) ret.push_back(i), odd[i] = 0;
for (pair<int, int> i : u) {
if (i.first >= time) break;
if (odd[i.second]) ret.push_back(i.second), odd[i.second] = 0;
}
return ret;
}
void curseChanges(int U, int A[], int B[]) {
for (int i = 0; i < U; i++) {
updates[A[i]].back().push_back({i, B[i]});
updates[B[i]].back().push_back({i, A[i]});
if (updates[A[i]].back().size() == C) {
trust[A[i]].push_back(playback(A[i], i + 1));
updates[A[i]].push_back({});
u_times[A[i]].push_back(i + 1);
}
if (updates[B[i]].back().size() == C) {
trust[B[i]].push_back(playback(B[i], i + 1));
updates[B[i]].push_back({});
u_times[B[i]].push_back(i + 1);
}
}
}
bool cmp(int a, int b) { return tie(H[a], a) < tie(H[b], b); }
int question(int x, int y, int v) {
vector<int> sx = playback(x, v);
vector<int> sy = playback(y, v);
sort(sx.begin(), sx.end(), cmp);
sort(sy.begin(), sy.end(), cmp);
int ans = INF;
for (int xptr = 0, yptr = 0; xptr != sx.size() && yptr != sy.size(); xptr++) {
while (yptr != sy.size() - 1 && H[sy[yptr + 1]] < H[sx[xptr]]) yptr++;
ans = min(ans, abs(H[sx[xptr]] - H[sy[yptr]]));
if (yptr != sy.size() - 1) ans = min(ans, abs(H[sx[xptr]] - H[sy[yptr + 1]]));
}
return ans;
}
