# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
740930 | enerelt14 | 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
#define pb push_back
using namespace std;
vector<int> x;
int n;
vector<int> construct_permutation(ll k){
if (k == 1)return {};
if (k == 2)return {0};
if (k == 3)return {1, 0};
if (k % 4 == 0){
x = construct_permutation(k / 4);
n = x.size();
x.pb(n);
x.pb(n + 1);
return x;
}
if (k % 4 == 1){
x = construct_permutation(k / 4);
n = x.size();
for (int i = 0; i < n; i++)x[i]++;
x.pb(n + 1);
x.pb(n + 2);
x.pb(0);
return x;
}
if (k % 4 == 2){
x = construct_permutation(k / 4);
n = x.size();
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |