#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
void divide(int n, int l, int r) {
if (l == r) return;
int mid = (l + r) / 2;
string s(n, '1');
for (int i = l; i <= r; i++) s[i] = '0';
for (int i = l; i <= mid; i++) {
s[i] = '1';
add_element(s);
s[i] = '0';
}
divide(n, l, mid);
divide(n, mid + 1, r);
}
void search(int n, int l, int r, vector<bool> present, vector<int> &ans) {
if (l == r) {
for (int i = 0; i < n; i++) {
if (!present[i]) ans[i] = l;
}
return;
}
int mid = (l + r) / 2;
vector<bool> leftPresent(n), rightPresent(n);
for (int i = 0; i < n; i++) {
leftPresent[i] = rightPresent[i] = present[i];
}
string s(n, '0');
for (int i = 0; i < n; i++) {
if (present[i]) s[i] = '1';
}
for (int i = 0; i < n; i++) {
if (!present[i]) {
s[i] = '1';
if (check_element(s)) {
leftPresent[i] = true;
}
else {
rightPresent[i] = true;
}
s[i] = '0';
}
}
search(n, l, mid, rightPresent, ans);
search(n, mid + 1, r, leftPresent, ans);
}
std::vector<int> restore_permutation(int n, int w, int r) {
divide(n, 0, n - 1);
compile_set();
vector<int> ans(n);
search(n, 0, n - 1, vector<bool>(n), ans);
return ans;
}
