#include<bits/stdc++.h>
#include "messy.h"
#define pb push_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 1e3 + 5;
const int mod = 1e9 + 7;
const ll oo = 1e18;
vector<int> p;
vector<int> vc[maxN][maxN];
string s;
void Prepair(int l, int r)
{
if(l == r) return;
int mid = (l + r) / 2;
for(int i=l; i<=mid; i++)
{
s[i] = '1';
add_element(s);
s[i] = '0';
}
Prepair(l, mid);
Prepair(mid + 1, r);
}
void DnC(int l, int r)
{
if(l == r) return;
int mid = (l + r) / 2;
for(int i=l; i<=mid; i++)
{
s[i] = '1';
if(check_element(s)) vc[l][mid].pb(i);
else vc[mid + 1][r].pb(i);
s[i] = '0';
}
DnC(l, mid);
DnC(mid + 1, r);
}
vector<int> restore_permutation(int n, int w, int r)
{
p.resize(n);
for(int i=0; i<n; i++)
vc[0][n - 1].pb(i);
for(int i=0; i<n; i++) s += '0';
Prepair(0, n - 1);
compile_set();
for(int i=0; i<n; i++) s[i] = '0';
DnC(0, n - 1);
for(int i=0; i<n; i++) p[i] = vc[i][i][0];
return p;
}
/*void Solve()
{
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ReadInput();
Solve();
}*/
Compilation message
team.cpp:2:10: fatal error: messy.h: No such file or directory
2 | #include "messy.h"
| ^~~~~~~~~
compilation terminated.
