#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
#define pb(x) push_back(x)
vector<int> ans;
int n;
void put(int l , int r){
if(l == r - 1)return;
int m = (l + r)/2;
string s = "";
for(int i = 0; i < n; i++){
s += '1';
}
for(int i = l; i < r; i++){
s[i] = '0';
}
for(int i = l; i < m; i++){
s[i] = '1';
add_element(s);
s[i] = '0';
}
add_element(s);
put(l , m);
put(m , r);
}
void solve(vector<int>& v , int l , int r){
//cout << l << ' ' << r << ' ' << v.size() << endl;
if(l == r - 1){
ans[l] = v[0];
return;
}
int m = (l + r)/2;
string s = "";
for(int i = 0; i < n; i++)s += '1';
for(int i = l; i < r; i++){
s[i] = '0';
}
vector<int> a , b;
for(int i = l; i < r; i++){
s[i] = '1';
if(check_element(s)){
a.pb(i);
}
else b.pb(i);
s[i] = '0';
}
//assert(a.size() == b.size());
solve(a , l , m);
solve(b,m,r);
}
vector<int> restore_permutation(int nn, int w, int r){
n = nn;
ans.resize(n);
put(0 , n);
compile_set();
vector<int> cur;
for(int i = 0; i < n; i++){
cur.pb(i);
}
solve(cur , 0 , n);
//cout << "came" << endl;
/*for(int i = 0; i < n; i++){
cout << ans[i] << endl;
}*/
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
grader returned WA |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
604 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
n = 32 |
2 |
Incorrect |
1 ms |
348 KB |
grader returned WA |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
2 ms |
1112 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
2 ms |
860 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |