#include "doll.h"
#include <iostream>
using namespace std;
vector<int> L, R, T, go, nw;
vector<int> inv, X, Y, del, pos;
int s;
void build(int v, int tl, int tr) {
if (tl == tr)
return;
if (L[v] == 0)
L[v] = ++s;
if (R[v] == 0)
R[v] = ++s;
int tm = tl + tr >> 1;
build(L[v], tl, tm);
build(R[v], tm + 1, tr);
}
void upd(int pos, int val, int v, int tl, int tr) {
if (tl == tr) {
go[v] = val;
T[v] = (val == 0);
return void();
}
int tm = tl + tr >> 1;
if (pos <= tm)
upd(pos, val, L[v], tl, tm);
else
upd(pos, val, R[v], tm + 1, tr);
T[v] = T[L[v]] + T[R[v]];
}
void clear(int v, int tl, int tr) {
del[v] = 1;
if (tl == tr)
return;
int tm = tl + tr >> 1;
clear(L[v], tl, tm);
clear(R[v], tm + 1, tr);
}
void make(int v, int tl, int tr) {
int tm = tl + tr >> 1;
if (T[L[v]] == tm - tl + 1) {
clear(L[v], tl, tm);
L[v] = 0;
}
if (T[R[v]] == tr - tm) {
clear(R[v], tm + 1, tr);
R[v] = 0;
}
if (tl == tm && L[v]) {
del[L[v]] = 1;
L[v] = go[L[v]];
}
if (tm + 1 == tr && R[v]) {
del[R[v]] = 1;
R[v] = go[R[v]];
}
if (tl == tr)
return;
if (L[v] > 0)
make(L[v], tl, tm);
if (R[v] > 0)
make(R[v], tm + 1, tr);
}
void create_circuit(int M, vector<int> A) {
int N = A.size();
vector<int> C(M + 1);
if (N == 1) {
C[0] = A[0];
C[A[0]] = 0;
answer(C, {}, {});
return;
}
int n = 1, len = 0;
while (n < N) {
n <<= 1;
len++;
}
n *= 2;
L.resize(n << 1), R.resize(n << 1), del.resize(n << 1), pos.resize(n << 1);
T.resize(n << 1); go.resize(n << 1), nw.resize(n << 1);
n /= 2;
vector<int> inv(n, 0);
build(0, 0, n - 1);
for (int i = 0; i < n; ++i) {
for (int j = 0; j <= len; ++j) {
inv[i] |= (1 << (len - j - 1)) * ((i >> j) & 1);
}
}
C[0] = A[0];
A.erase(A.begin());
A.push_back(0);
for (int i = 0; i < n - N; ++i) {
upd(i, 0, 0, 0, n - 1);
}
for (int i = n - N, col = 0; i < n; ++i) {
pos[inv[i]] = 1;
}
for (int i = 0, col = 0; i < n; ++i) {
if (pos[i] == 1)
pos[i] = col++;
}
for (int i = n - N; i < n; ++i) {
upd(i, -A[pos[inv[i]]] - 1, 0, 0, n - 1);
}
make(0, 0, n - 1);
for (int i = 0, is = 0; i <= s; ++i) {
if (del[i]) {
continue;
}
is--;
nw[i] = is;
}
for (int v = 0; v <= s; ++v) {
if (del[v]) {
continue;
}
if (L[v] >= 0)
X.push_back(nw[L[v]]);
else
X.push_back(-L[v] - 1);
if (R[v] >= 0)
Y.push_back(nw[R[v]]);
else
Y.push_back(-R[v] - 1);
}
for (int i = 1; i <= M; ++i)
C[i] = -1;
answer(C, X, Y);
}
