#include <bits/stdc++.h>
#include "perm.h"
using namespace std;
typedef long long i64;
typedef vector<int> vi;
const int mxLOG = 62;
vi construct_permutation(i64 K) {
i64 k = K - 1;
int n = 0; vi t, a;
for(int i = mxLOG - 1; i >= 1; i--) {
i64 cnt = (1LL << i) - 1LL;
while(k >= cnt) {
k -= cnt;
n += i;
t.push_back(i);
// cout << " size: " << i << endl;
}
}
int en = n - 1;
for(int cnt : t) {
int st = en - cnt + 1;
for(int i = st; i <= en; i++)
a.push_back(i);
en = st - 1;
}
// for(int x : a)
// cout << x << ' ';
// cout << endl;
return a;
}
# |
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 |
Partially correct |
1 ms |
348 KB |
Partially correct |
4 |
Partially correct |
1 ms |
348 KB |
Partially correct |
5 |
Partially correct |
4 ms |
604 KB |
Partially correct |
6 |
Partially correct |
4 ms |
604 KB |
Partially correct |
7 |
Partially correct |
6 ms |
944 KB |
Partially correct |
8 |
Partially correct |
9 ms |
1116 KB |
Partially correct |
9 |
Correct |
2 ms |
344 KB |
Output is correct |
10 |
Partially correct |
10 ms |
1432 KB |
Partially correct |
11 |
Partially correct |
8 ms |
1184 KB |
Partially correct |
12 |
Partially correct |
8 ms |
860 KB |
Partially correct |
13 |
Partially correct |
8 ms |
952 KB |
Partially correct |