#include <bits/stdc++.h>
#include "perm.h"
using namespace std;
using ll = long long;
std::vector<int> construct_permutation(long long k) {
vector<int> ops, perm;
while (k > 1) {
if (k & 1) {
k--;
ops.push_back(1);
} else {
k /= 2;
ops.push_back(0);
}
}
reverse(ops.begin(), ops.end());
int cur = 0;
for (auto& x : ops) {
if (x == 0) {
perm.push_back(cur++);
} else perm.insert(perm.begin(), cur++);
}
return perm;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
1 ms |
436 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Partially correct |
1 ms |
348 KB |
Partially correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Partially correct |
1 ms |
344 KB |
Partially correct |
9 |
Correct |
2 ms |
348 KB |
Output is correct |
10 |
Partially correct |
2 ms |
436 KB |
Partially correct |
11 |
Partially correct |
1 ms |
344 KB |
Partially correct |
12 |
Partially correct |
1 ms |
348 KB |
Partially correct |
13 |
Partially correct |
1 ms |
348 KB |
Partially correct |