# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
981639 | crafticat | Permutation (APIO22_perm) | C++17 | 2 ms | 428 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 <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
std::vector<int> construct_permutation(long long k) {
k--;
int ma = 1e9;
int mi = 0;
vector<int> data;
while (k > 0) {
if (k % 2 == 1) {
data.push_back(ma--);
k = (k - 1) / 2;
} else {
data.push_back(mi++);
k--;
}
}
std::reverse(data.begin(), data.end());
vector<pii> d2(data.size());
for (int i = 0; i < data.size(); ++i) {
d2[i] = {data[i],i};
}
std::sort(d2.begin(), d2.end());
vector<int> ans(data.size());
int iter = 0;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |