#include "bits/stdc++.h"
#include "perm.h"
// #include "grader.cpp"
using namespace std;
using ll = long long;
vector<int> construct_permutation(ll k) {
k--;
vector<int> v;
int l = INT_MIN, r = INT_MAX;
while (k) {
if (k & 1) {
v.push_back(l++);
k >>= 1;
}
else {
v.push_back(r--);
k--;
}
}
map<int, int> m;
for (auto i : v)
m[i] = 1;
int X = 0;
for (auto &i : m)
i.second = X++;
for (auto &i : v)
i = m[i];
return v;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |