# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
621469 | gromperen | Permutation (APIO22_perm) | C++17 | 2 ms | 340 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "perm.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<int> construct_permutation(ll k) {
vector<int> ans;
int x = __lg(k);
for (int i = 0; i < x; ++i) ans.push_back(i);
for (int i = x - 1; i >= 0; --i) {
if ((k>>i)&1) {
ans.insert(ans.begin()+i, x);
x++;
}
}
return ans;
}
/*
vector<int> construct_permutation(ll k)
{
k--;
vector<int> ans;
int mx = 0;
while (k > 0) {
int i = 60;
while ((1LL << i) - 1 > k) {
i--;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |