# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
578418 | 1zaid1 | Permutation (APIO22_perm) | C++17 | 4 ms | 456 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"
using namespace std;
std::vector<int> construct_permutation(long long k)
{
int p = 1;
vector<int> ans;
int mx = 1, mn = -1;
vector<int> steps;
while (k) {
if (k%2) steps.push_back(1);
steps.push_back(0);
k /= 2;
}
steps.pop_back();
steps.pop_back();
reverse(steps.begin(), steps.end());
for (int i:steps) {
if (i) ans.push_back(mn--);
else ans.push_back(mx++);
}
map<int, int> fr;
vector<int> tmp = ans;
int ind = 0;
sort(tmp.begin(), tmp.end());
for (int i:tmp) {
fr[i] = ind++;
}
for (int&i:ans) i = fr[i];
return ans;
}
/*
1 2 4 5 10 11 22 23
{}
{0 1 -1 2 -2 3 -3}
{3 4 2 5 1 6 0}
{}
*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |