#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
vector<int> ans;
void add(int l, int r, string s){
if(l == r) return;
int m = (l + r + 1) / 2;
for(int i=l; i<m; i++){
s[i] = '1';
add_element(s);
s[i] = '0';
}
string s_left = s, s_right = s;
for(int i=m; i<=r; i++) s_left[i] = '1';
for(int i=l; i<m; i++) s_right[i] = '1';
add(l, m - 1, s_left);
add(m, r, s_right);
}
void check(int l, int r, string s, vector<int> v){
if(l == r){
ans[v[0]] = l;
return;
}
vector<int> v_left, v_right;
for(auto i : v){
s[i] = '1';
if(check_element(s)){
v_left.push_back(i);
} else v_right.push_back(i);
s[i] = '0';
}
string s_left = s, s_right = s;
for(auto i : v_right) s_left[i] = '1';
for(auto i : v_left) s_right[i] = '1';
int m = (l + r + 1) / 2;
check(l, m - 1, s_left, v_left);
check(m, r, s_right, v_right);
}
vector<int> restore_permutation(int n, int w, int r){
string s;
for(int i=0; i<n; i++) s.push_back('0');
add(0, n - 1, s);
compile_set();
for(int i=0; i<n; i++) s[i] = '0';
ans.resize(n);
vector<int> v;
for(int i=0; i<n; i++) v.push_back(i);
check(0, n - 1, s, v);
return ans;
}
Compilation message (stderr)
messy.h:1:9: warning: #pragma once in main file
1 | #pragma once
| ^~~~
messy_c.h:1:9: warning: #pragma once in main file
1 | #pragma once
| ^~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |