#include "doll.h"
#include <bits/stdc++.h>
#define mp make_pair
#define xx first
#define yy second
#define pb push_back
using namespace std;
typedef pair<int, int> pii;
/**********************/
/* YOU ARE INVITED TO */
/* */
/* SUFFER */
/* */
/* ######## */
/* # JOIN # */
/* ######## */
/* */
/**********************/
vector<bool> tree;
int N;
pii trial(int node){
if (node*2 + 1 > N - 2){ //last node??
tree[node] = tree[node] ^ 1;
return mp(tree[node] ^ 1, node);
}
if (tree[node]){ // baruun child
tree[node] = tree[node] ^ 1;
return trial(node*2 + 2);
}
else{
tree[node] = tree[node] ^ 1;
return trial(node*2 + 1);
}
}
void create_circuit(int m, vector<int> a) {
int n = a.size();
vector<int> c(m + 1);
N = 1 << (int) ceil( log((double) n)/log(2.0) );
vector<int> x, y;
x.resize(N - 1);
y.resize(N - 1);
tree.resize(N - 1);
// cout << N << '\n';
c[0] = -1; //connect it to first switch
for (int i = 0; i < N; i++){
pii tmp = trial(0);
if (i < n){
c[a[i]] = -1;
// cout << tmp.xx << "&" << tmp.yy << "&" << a[i] << '\n';
if (tmp.xx == 0){
x[tmp.yy] = a[i];
}
else{
y[tmp.yy] = a[i];
}
}
else if (i == n){
if (tmp.xx == 0){
x[tmp.yy] = 0;
}
else{
y[tmp.yy] = 0;
}
}
else{
if (tmp.xx == 0){
x[tmp.yy] = -1;
}
else{
y[tmp.yy] = -1;
}
}
}
for (int i = 0; i * 2 + 1 <= N - 2; i++){
x[i] = -(i*2 + 1 + 1);
y[i] = -(i*2 + 2 + 1);
}
// switch with N different outputs
// for (int X : x){
// cout << X << ' ';
// }
answer(c, x, y);
}
// int main(){ // DRIVER - CHAN
// create_circuit(4, {1, 2, 1, 3});
// }
