#include "doll.h"
#include <vector>
#include <iostream>
using namespace std;
void create_circuit(int M, vector<int> A)
{
vector<int> C(M+1, -1);
vector<int> X, Y;
int N = A.size();
C[0] = A[0];
if(N == 1)
{
C = vector<int>(M+1, 0);
answer(C, X, Y);
return;
}
C[A[0]] = -1;
int p;
for(p = 1; 2*(1 << p) < N; p++); //1<<p is the size of the last row of the binary tree
//2*(1<<p) = 1<<(p+1) <= N < (1<<p+2)
X = vector<int>( (1 << (p+1)) - 1 , -1);
Y = vector<int>( (1 << (p+1)) - 1 , -1);
for(int i = 1; i <= (1 << p); i++)
{
X[i-1] = -2*i;
Y[i-1] = -(2*i + 1);
}
// cout << "0 " << C[0] << '\n';
// for(int i = 1; i < (1 << (p+1)); i++) cout << i << ' ' << X[i-1] << ' ' << Y[i-1] << '\n';
for(int i = (1 << (p+1)); i < (1 << (p+2)); i++)
{
// cout << "switch = " << i << '\n';
if(i - (1 << (p+1)) + 1 < N)
{
if(i % 2 == 0) X[i/2 - 1] = A[i - (1 << (p+1)) + 1];
else Y[i/2 - 1] = A[i - (1 << (p+1)) + 1];
}
else if(i == (1 << (p+2))-1)
{
Y[i/2 - 1] = 0;
}
else
{
if(i % 2 == 0) X[i/2 - 1] = -1;
else Y[i/2 - 1] = -1;
}
}
answer(C, X, Y);
}
