#include "perm.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector <ll>;
using vi = vector <int>;
vi construct_permutation (ll k) {
vector <double> dans;
ll bits = 0;
{ll kk = k/2;
while (kk) {
dans.push_back(bits);
bits++;
kk /= 2;
}}
ll i = bits;
assert(k>>i&1);
for (i--; i >= 0; i--) {
if (k>>i&1) {
dans.push_back(-0.5+i);
}
}
vector <double> key(dans);
sort(key.begin(), key.end());
vi ans;
for (double i : dans) {
ans.push_back(lower_bound(key.begin(), key.end(), i)-key.begin());
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
512 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 |
2 ms |
348 KB |
Partially correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Partially correct |
2 ms |
348 KB |
Partially correct |
11 |
Partially correct |
2 ms |
344 KB |
Partially correct |
12 |
Partially correct |
2 ms |
348 KB |
Partially correct |
13 |
Partially correct |
2 ms |
348 KB |
Partially correct |