#include "messy.h"
#include <algorithm>
#include <vector>
using namespace std;
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
vector<int> restore_permutation(int n, int, int) {
for (int z = n; z != 1; z >>= 1)
for (int l = 0; l != n; l += z) {
string s(n, '1');
rep(i, l, l + z) s[i] = '0';
rep(i, l, l + z / 2) {
s[i] = '1';
add_element(s);
s[i] = '0';
}
}
compile_set();
vector<int> p(n); rep(i, 0, n) p[i] = i;
for (int z = n; z != 1; z >>= 1) {
vector<bool> v(n);
for (int l = 0; l != n; l += z) {
string s(n, '1');
rep(i, l, l + z) s[p[i]] = '0';
rep(i, l, l + z) {
s[p[i]] = '1';
v[p[i]] = check_element(s);
s[p[i]] = '0';
}
partition(begin(p) + l, begin(p) + l + z, [&v](int x) { return v[x]; });
}
}
vector<int> q(n);
rep(i, 0, n) q[p[i]] = i;
return q;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
n = 8 |
2 |
Correct |
5 ms |
384 KB |
n = 8 |
3 |
Correct |
5 ms |
256 KB |
n = 8 |
4 |
Correct |
5 ms |
384 KB |
n = 8 |
5 |
Correct |
5 ms |
384 KB |
n = 8 |
6 |
Correct |
5 ms |
256 KB |
n = 8 |
7 |
Correct |
5 ms |
384 KB |
n = 8 |
8 |
Correct |
5 ms |
384 KB |
n = 8 |
9 |
Correct |
5 ms |
256 KB |
n = 8 |
10 |
Correct |
4 ms |
256 KB |
n = 8 |
11 |
Correct |
5 ms |
256 KB |
n = 8 |
12 |
Correct |
5 ms |
256 KB |
n = 8 |
13 |
Correct |
5 ms |
256 KB |
n = 8 |
14 |
Correct |
4 ms |
256 KB |
n = 8 |
15 |
Correct |
5 ms |
256 KB |
n = 8 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
n = 32 |
2 |
Correct |
5 ms |
384 KB |
n = 32 |
3 |
Correct |
5 ms |
384 KB |
n = 32 |
4 |
Correct |
6 ms |
308 KB |
n = 32 |
5 |
Correct |
5 ms |
384 KB |
n = 32 |
6 |
Correct |
5 ms |
384 KB |
n = 32 |
7 |
Correct |
5 ms |
384 KB |
n = 32 |
8 |
Correct |
5 ms |
384 KB |
n = 32 |
9 |
Correct |
5 ms |
384 KB |
n = 32 |
10 |
Correct |
5 ms |
384 KB |
n = 32 |
11 |
Correct |
5 ms |
384 KB |
n = 32 |
12 |
Correct |
5 ms |
384 KB |
n = 32 |
13 |
Correct |
5 ms |
384 KB |
n = 32 |
14 |
Correct |
5 ms |
384 KB |
n = 32 |
15 |
Correct |
5 ms |
384 KB |
n = 32 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
384 KB |
n = 32 |
2 |
Correct |
5 ms |
384 KB |
n = 32 |
3 |
Correct |
6 ms |
384 KB |
n = 32 |
4 |
Correct |
6 ms |
384 KB |
n = 32 |
5 |
Correct |
5 ms |
384 KB |
n = 32 |
6 |
Correct |
5 ms |
384 KB |
n = 32 |
7 |
Correct |
5 ms |
384 KB |
n = 32 |
8 |
Correct |
5 ms |
432 KB |
n = 32 |
9 |
Correct |
5 ms |
384 KB |
n = 32 |
10 |
Correct |
5 ms |
384 KB |
n = 32 |
11 |
Correct |
5 ms |
384 KB |
n = 32 |
12 |
Correct |
5 ms |
384 KB |
n = 32 |
13 |
Correct |
5 ms |
384 KB |
n = 32 |
14 |
Correct |
5 ms |
384 KB |
n = 32 |
15 |
Correct |
5 ms |
384 KB |
n = 32 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
512 KB |
n = 128 |
2 |
Correct |
6 ms |
512 KB |
n = 128 |
3 |
Correct |
6 ms |
512 KB |
n = 128 |
4 |
Correct |
6 ms |
512 KB |
n = 128 |
5 |
Correct |
6 ms |
640 KB |
n = 128 |
6 |
Correct |
6 ms |
512 KB |
n = 128 |
7 |
Correct |
6 ms |
512 KB |
n = 128 |
8 |
Correct |
6 ms |
512 KB |
n = 128 |
9 |
Correct |
6 ms |
512 KB |
n = 128 |
10 |
Correct |
6 ms |
512 KB |
n = 128 |
11 |
Correct |
7 ms |
512 KB |
n = 128 |
12 |
Correct |
6 ms |
512 KB |
n = 128 |
13 |
Correct |
6 ms |
512 KB |
n = 128 |
14 |
Correct |
6 ms |
512 KB |
n = 128 |
15 |
Correct |
7 ms |
512 KB |
n = 128 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
512 KB |
n = 128 |
2 |
Correct |
6 ms |
512 KB |
n = 128 |
3 |
Correct |
6 ms |
512 KB |
n = 128 |
4 |
Correct |
6 ms |
512 KB |
n = 128 |
5 |
Correct |
6 ms |
512 KB |
n = 128 |
6 |
Correct |
7 ms |
512 KB |
n = 128 |
7 |
Correct |
6 ms |
512 KB |
n = 128 |
8 |
Correct |
6 ms |
512 KB |
n = 128 |
9 |
Correct |
6 ms |
512 KB |
n = 128 |
10 |
Correct |
6 ms |
512 KB |
n = 128 |
11 |
Correct |
6 ms |
512 KB |
n = 128 |
12 |
Correct |
6 ms |
488 KB |
n = 128 |
13 |
Correct |
6 ms |
512 KB |
n = 128 |
14 |
Correct |
6 ms |
512 KB |
n = 128 |
15 |
Correct |
6 ms |
552 KB |
n = 128 |