| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1362460 | aaaaaaaa | Permutation (APIO22_perm) | C++20 | 1 ms | 344 KiB |
#include <bits/stdc++.h>
#include "perm.h"
using namespace std;
vector<int> construct_permutation(long long k) {
int l = __lg(k);
vector <int> a(l);
for (int i = 0; i < l; ++i) a[i] = i;
assert((k >> l) & 1);
for (int i = l - 1; i >= 0; --i) {
if ((k >> i) & 1) {
a.insert(a.begin() + i, (int) a.size());
}
}
return a;
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
