# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1168158 | wii | Permutation (APIO22_perm) | C++17 | 0 ms | 320 KiB |
#include <bits/stdc++.h>
#include "perm.h"
using namespace std;
void dnc(deque<int> &v, int id, long long u) {
if (id < 0) return;
if (u & 1) {
dnc(v, id - 1, u >> 1);
v.push_back(id);
} else {
dnc(v, id - 1, u - 1);
v.push_front(id);
}
}
vector<int> construct_permutation(long long k) {
k -= 1;
int cnt = 0;
for (long long x = k; x > 0; x = (~x & 1 ? --x : x >> 1), ++cnt);
deque<int> ans;
dnc(ans, cnt - 2, k);
return vector<int>(ans.begin(), ans.end());
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |