#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include "messy.h"
std::string initialize(int n, int l, int r) {
std::string s(n, '1');
for (int i = l; i <= r; i++)
s[i] = '0';
return s;
}
void insertions(int n, int l, int r) {
if (l == r)
return;
int m = (l + r) / 2;
std::string s = initialize(n, l, r);
for (int i = l; i <= m; i++) {
s[i] = '1';
add_element(s);
s[i] = '0';
}
insertions(n, l, m);
insertions(n, m + 1, r);
}
std::string initializeQuery(int n, std::vector<bool> &com) {
std::string s(n, '0');
for (int i = 0; i < n; i++) {
if (com[i])
s[i] = '1';
}
return s;
}
int findElement(int n, std::vector<bool> &inSet) {
for (int i = 0; i < n; i++)
if(inSet[i])
return i;
return -1;
}
void getPermutation(int n, int l, int r, std::vector<bool> &inSet, std::vector<bool> &outSet, std::vector<int> &ans) {
if (l == r) {
ans[l] = findElement(n, inSet);
return;
}
std::string s = initializeQuery(n, outSet);
std::vector<bool> inSetLeft(n, false), inSetRight(n, false);
std::vector<bool> outSetLeft, outSetRight;
outSetLeft = outSetRight = outSet;
int m = (l + r) / 2;
for (int i = 0; i < n; i++) {
if (s[i] == '0') {
s[i] = '1';
if (check_element(s)) {
inSetLeft[i] = true;
outSetRight[i] = true;
} else {
inSetRight[i] = true;
outSetLeft[i] = true;
}
s[i] = '0';
}
}
getPermutation(n, l, m, inSetLeft, outSetLeft, ans);
getPermutation(n, m + 1, r, inSetRight, outSetRight, ans);
}
std::vector<int> getAns(int n, std::vector<int> &preAns) {
std::vector<int> ans(n, 0);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (preAns[j] == i) {
ans[i] = j;
break;
}
}
}
return ans;
}
std::vector<int> restore_permutation(int n, int w, int r) {
insertions(n, 0, n - 1);
std::vector<int> preAns(n);
std::vector<bool> inSet(n, true);
std::vector<bool> outSet(n, false);
compile_set();
getPermutation(n, 0, n - 1, inSet, outSet, preAns);
return getAns(n, preAns);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
n = 8 |
2 |
Correct |
1 ms |
348 KB |
n = 8 |
3 |
Correct |
0 ms |
348 KB |
n = 8 |
4 |
Correct |
0 ms |
348 KB |
n = 8 |
5 |
Correct |
0 ms |
348 KB |
n = 8 |
6 |
Correct |
0 ms |
348 KB |
n = 8 |
7 |
Correct |
0 ms |
348 KB |
n = 8 |
8 |
Correct |
0 ms |
348 KB |
n = 8 |
9 |
Correct |
0 ms |
348 KB |
n = 8 |
10 |
Correct |
0 ms |
348 KB |
n = 8 |
11 |
Correct |
0 ms |
348 KB |
n = 8 |
12 |
Correct |
1 ms |
348 KB |
n = 8 |
13 |
Correct |
0 ms |
348 KB |
n = 8 |
14 |
Correct |
0 ms |
348 KB |
n = 8 |
15 |
Correct |
0 ms |
436 KB |
n = 8 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
n = 32 |
2 |
Correct |
0 ms |
348 KB |
n = 32 |
3 |
Correct |
0 ms |
344 KB |
n = 32 |
4 |
Correct |
0 ms |
348 KB |
n = 32 |
5 |
Correct |
0 ms |
348 KB |
n = 32 |
6 |
Correct |
1 ms |
348 KB |
n = 32 |
7 |
Correct |
0 ms |
436 KB |
n = 32 |
8 |
Correct |
1 ms |
348 KB |
n = 32 |
9 |
Correct |
0 ms |
436 KB |
n = 32 |
10 |
Correct |
0 ms |
348 KB |
n = 32 |
11 |
Correct |
0 ms |
348 KB |
n = 32 |
12 |
Correct |
0 ms |
432 KB |
n = 32 |
13 |
Correct |
0 ms |
344 KB |
n = 32 |
14 |
Correct |
0 ms |
348 KB |
n = 32 |
15 |
Correct |
1 ms |
344 KB |
n = 32 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
n = 32 |
2 |
Correct |
0 ms |
348 KB |
n = 32 |
3 |
Correct |
1 ms |
344 KB |
n = 32 |
4 |
Correct |
0 ms |
348 KB |
n = 32 |
5 |
Correct |
0 ms |
348 KB |
n = 32 |
6 |
Correct |
0 ms |
348 KB |
n = 32 |
7 |
Correct |
0 ms |
348 KB |
n = 32 |
8 |
Correct |
0 ms |
348 KB |
n = 32 |
9 |
Correct |
0 ms |
348 KB |
n = 32 |
10 |
Correct |
1 ms |
348 KB |
n = 32 |
11 |
Correct |
0 ms |
348 KB |
n = 32 |
12 |
Correct |
0 ms |
348 KB |
n = 32 |
13 |
Correct |
1 ms |
348 KB |
n = 32 |
14 |
Correct |
1 ms |
344 KB |
n = 32 |
15 |
Correct |
1 ms |
348 KB |
n = 32 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
604 KB |
n = 128 |
2 |
Correct |
1 ms |
604 KB |
n = 128 |
3 |
Correct |
1 ms |
604 KB |
n = 128 |
4 |
Correct |
2 ms |
604 KB |
n = 128 |
5 |
Correct |
2 ms |
604 KB |
n = 128 |
6 |
Correct |
1 ms |
600 KB |
n = 128 |
7 |
Correct |
1 ms |
604 KB |
n = 128 |
8 |
Correct |
1 ms |
604 KB |
n = 128 |
9 |
Correct |
1 ms |
600 KB |
n = 128 |
10 |
Correct |
1 ms |
604 KB |
n = 128 |
11 |
Correct |
1 ms |
604 KB |
n = 128 |
12 |
Correct |
1 ms |
604 KB |
n = 128 |
13 |
Correct |
1 ms |
604 KB |
n = 128 |
14 |
Correct |
1 ms |
436 KB |
n = 128 |
15 |
Correct |
1 ms |
604 KB |
n = 128 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
604 KB |
n = 128 |
2 |
Correct |
1 ms |
604 KB |
n = 128 |
3 |
Correct |
1 ms |
600 KB |
n = 128 |
4 |
Correct |
1 ms |
604 KB |
n = 128 |
5 |
Correct |
2 ms |
604 KB |
n = 128 |
6 |
Correct |
1 ms |
604 KB |
n = 128 |
7 |
Correct |
1 ms |
604 KB |
n = 128 |
8 |
Correct |
1 ms |
608 KB |
n = 128 |
9 |
Correct |
1 ms |
608 KB |
n = 128 |
10 |
Correct |
1 ms |
604 KB |
n = 128 |
11 |
Correct |
1 ms |
612 KB |
n = 128 |
12 |
Correct |
1 ms |
612 KB |
n = 128 |
13 |
Correct |
1 ms |
612 KB |
n = 128 |
14 |
Correct |
1 ms |
612 KB |
n = 128 |
15 |
Correct |
1 ms |
612 KB |
n = 128 |