# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1148490 | blackslex | Permutation (APIO22_perm) | C++20 | 1 ms | 328 KiB |
#include "perm.h"
#include<bits/stdc++.h>
using namespace std;
std::vector<int> construct_permutation(long long k) {
vector<int> c;
for (int i = 60; i >= 0; i--) {
if (k & (1LL << i)) c.emplace_back(i);
}
int sz = c[0];
vector<int> ans(sz); iota(ans.begin(), ans.end(), 0);
int cur = sz;
for (int i = 1; i < c.size(); i++) {
ans.insert(ans.begin() + c[i], cur++);
}
return ans;
return {};
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |