#include <bits/stdc++.h>
#include "messy.h"
#define N 128
using namespace std;
int n;
vector<int> ans;
void add(int l,int r,set<int> s){
if(l == r)return;
string now="";
for(int i = 0;i<n;i++){
now+='0';
}
for(auto u:s){
now[u] = '1';
}
int m = (l + r)/2;
for(int i = l;i<=m;i++){
assert(now[i] == '0');
now[i] = '1';
add_element(now);
now[i] = '0';
}
set<int> a = s;
set<int> b = s;
for(int i = l;i<=m;i++){
b.insert(i);
}
for(int i = m+1;i<=r;i++){
a.insert(i);
}
add(l,m,a);
add(m+1,r,b);
}
void get(int l,int r,set<int> s,set<int> s2){
// cout << l << " " << r << endl;
// for(auto u:s){
// cout << u << " ";
// }
// cout << endl;
// for(auto u:s2){
// cout << u << " ";
// }
// cout << endl;
if(l == r){
ans[*s.begin()] = l;
return;
}
string now="";
for(int i = 0;i<n;i++){
now+='0';
}
for(auto u:s2){
now[u] = '1';
}
vector<int> v;
for(auto u:s){
v.push_back(u);
}
set<int> onl,onr;
onr = s;
int m = (l + r)/2;
for(int i = l;i<=r;i++){
assert(now[v[i - l]] == '0');
now[v[i - l]] = '1';
if(check_element(now)){
onl.insert(v[i-l]);
onr.erase(v[i-l]);
}
now[v[i - l]] = '0';
}
set<int> a = s2;
set<int> b = s2;
for(auto u:onr){
a.insert(u);
}
for(auto u:onl){
b.insert(u);
}
get(l,m,onl,a);
get(m+1,r,onr,b);
}
vector<int> restore_permutation(int n_, int w, int r) {
n = n_;
add(0,n-1,{});
compile_set();
ans.resize(n);
set<int> s;
for(int i = 0;i<n;i++){
s.insert(i);
}
get(0,n-1,s,{});
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
n = 8 |
2 |
Correct |
1 ms |
212 KB |
n = 8 |
3 |
Correct |
1 ms |
212 KB |
n = 8 |
4 |
Correct |
0 ms |
212 KB |
n = 8 |
5 |
Correct |
1 ms |
212 KB |
n = 8 |
6 |
Correct |
0 ms |
212 KB |
n = 8 |
7 |
Correct |
1 ms |
300 KB |
n = 8 |
8 |
Correct |
0 ms |
212 KB |
n = 8 |
9 |
Correct |
0 ms |
212 KB |
n = 8 |
10 |
Correct |
1 ms |
212 KB |
n = 8 |
11 |
Correct |
1 ms |
212 KB |
n = 8 |
12 |
Correct |
1 ms |
296 KB |
n = 8 |
13 |
Correct |
0 ms |
212 KB |
n = 8 |
14 |
Correct |
1 ms |
212 KB |
n = 8 |
15 |
Correct |
1 ms |
212 KB |
n = 8 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
n = 32 |
2 |
Correct |
1 ms |
340 KB |
n = 32 |
3 |
Correct |
1 ms |
340 KB |
n = 32 |
4 |
Correct |
1 ms |
340 KB |
n = 32 |
5 |
Correct |
1 ms |
340 KB |
n = 32 |
6 |
Correct |
1 ms |
340 KB |
n = 32 |
7 |
Correct |
1 ms |
340 KB |
n = 32 |
8 |
Correct |
1 ms |
340 KB |
n = 32 |
9 |
Correct |
1 ms |
340 KB |
n = 32 |
10 |
Correct |
1 ms |
340 KB |
n = 32 |
11 |
Correct |
1 ms |
340 KB |
n = 32 |
12 |
Correct |
1 ms |
340 KB |
n = 32 |
13 |
Correct |
1 ms |
340 KB |
n = 32 |
14 |
Correct |
1 ms |
340 KB |
n = 32 |
15 |
Correct |
1 ms |
340 KB |
n = 32 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
n = 32 |
2 |
Correct |
1 ms |
340 KB |
n = 32 |
3 |
Correct |
1 ms |
296 KB |
n = 32 |
4 |
Correct |
1 ms |
340 KB |
n = 32 |
5 |
Correct |
1 ms |
340 KB |
n = 32 |
6 |
Correct |
1 ms |
340 KB |
n = 32 |
7 |
Correct |
1 ms |
340 KB |
n = 32 |
8 |
Correct |
1 ms |
340 KB |
n = 32 |
9 |
Correct |
1 ms |
340 KB |
n = 32 |
10 |
Correct |
1 ms |
300 KB |
n = 32 |
11 |
Correct |
1 ms |
340 KB |
n = 32 |
12 |
Correct |
1 ms |
340 KB |
n = 32 |
13 |
Correct |
1 ms |
340 KB |
n = 32 |
14 |
Correct |
1 ms |
336 KB |
n = 32 |
15 |
Correct |
1 ms |
340 KB |
n = 32 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
608 KB |
n = 128 |
2 |
Correct |
6 ms |
596 KB |
n = 128 |
3 |
Correct |
6 ms |
596 KB |
n = 128 |
4 |
Correct |
6 ms |
596 KB |
n = 128 |
5 |
Correct |
6 ms |
564 KB |
n = 128 |
6 |
Correct |
6 ms |
596 KB |
n = 128 |
7 |
Correct |
6 ms |
596 KB |
n = 128 |
8 |
Correct |
7 ms |
596 KB |
n = 128 |
9 |
Correct |
6 ms |
596 KB |
n = 128 |
10 |
Correct |
6 ms |
596 KB |
n = 128 |
11 |
Correct |
6 ms |
552 KB |
n = 128 |
12 |
Correct |
6 ms |
604 KB |
n = 128 |
13 |
Correct |
6 ms |
596 KB |
n = 128 |
14 |
Correct |
6 ms |
552 KB |
n = 128 |
15 |
Correct |
7 ms |
596 KB |
n = 128 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
556 KB |
n = 128 |
2 |
Correct |
6 ms |
596 KB |
n = 128 |
3 |
Correct |
7 ms |
616 KB |
n = 128 |
4 |
Correct |
6 ms |
596 KB |
n = 128 |
5 |
Correct |
6 ms |
596 KB |
n = 128 |
6 |
Correct |
6 ms |
596 KB |
n = 128 |
7 |
Correct |
6 ms |
560 KB |
n = 128 |
8 |
Correct |
6 ms |
512 KB |
n = 128 |
9 |
Correct |
6 ms |
596 KB |
n = 128 |
10 |
Correct |
6 ms |
596 KB |
n = 128 |
11 |
Correct |
6 ms |
604 KB |
n = 128 |
12 |
Correct |
6 ms |
596 KB |
n = 128 |
13 |
Correct |
7 ms |
596 KB |
n = 128 |
14 |
Correct |
6 ms |
556 KB |
n = 128 |
15 |
Correct |
6 ms |
552 KB |
n = 128 |