#include "doll.h"
#include<bits/stdc++.h>
using namespace std;
struct node {
int l = INT_MIN, r = INT_MIN, y = 0, valid = 1, d = 0;
};
int timer = 2, dep;
vector<int> x, y;
node tree[500005];
void build(int n, int d) {
tree[n].d = d;
if (dep-1 == d) {
return;
}
tree[n].l = -timer;
timer++;
tree[n].r = -timer;
timer++;
build(-tree[n].l, d+1);
build(-tree[n].r, d+1);
}
void create(int n, int d, int v) {
if (dep-1 == d) {
if (tree[n].y == 0) {
tree[n].l = v;
} else {
tree[n].r = v;
}
} else {
if (tree[n].y == 0) {
create(-tree[n].l, d+1, v);
} else {
create(-tree[n].r, d+1, v);
}
}
tree[n].y ^= 1;
}
void clean(int n, int d) {
if (dep-1 == d) {
if (tree[n].l == INT_MIN && tree[n].r == INT_MIN) {
tree[n].valid = 0;
}
if (tree[n].l == INT_MIN) {
tree[n].l = -1;
}
if (tree[n].r == INT_MIN) {
tree[n].r = -1;
}
} else {
clean(-tree[n].l, d+1);
clean(-tree[n].r, d+1);
tree[n].valid |= tree[-tree[n].l].valid;
tree[n].valid |= tree[-tree[n].r].valid;
if (tree[-tree[n].l].valid == 0) {
tree[n].l = -1;
}
if (tree[-tree[n].r].valid == 0) {
tree[n].r = -1;
}
}
}
void create_circuit(int m, vector<int> a) {
vector<int> d(m+1, 0);
d[0] = a[0];
if (a.size() == 1) {
answer(d, x, y);
return;
}
d[a[0]] = -1;
int n = a.size(), s;
dep = ceil(log2(n));
s = 1 << dep;
build(1, 0);
for (int i = 1; i < s; i++) {
if (i < a.size()) {
create(1, 0, a[i]);
d[a[i]] = -1;
} else {
create(1, 0, INT_MIN);
}
}
create(1, 0, 0);
clean(1, 0);
//for (int i = 1; i < s; i++) {
// cout << tree[i].l << " " << tree[i].r << endl;
//}
//cout << endl;
for (int i = 1; i < s; i++) {
if (tree[i].valid == 0) {
continue;
}
x.push_back(tree[i].l);
y.push_back(tree[i].r);
}
answer(d, x, y);
}
