| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 915137 | Amirreza_Fakhri | Permutation (APIO22_perm) | C++17 | 0 ms | 0 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.
// In the name of the God
#include <bits/stdc++.h>
#include "perm.h"
#define ll long long
#define int long long
#define pb push_back
#define F first
#define S second
#define mp make_pair
#define pii pair <int, int>
#define smin(x, y) (x) = min((x), (y))
#define smax(x, y) (x) = max((x), (y))
#define all(x) (x).begin(), (x).end()
using namespace std;
const int inf = 1e9+7;
const int mod = 998244353;
const int maxn = 2e5+5;
vector <int> construct_permutation(int k) {
vector <int> res;
if (k == 1) {
return res;
}
if (k == 2) {
res.pb(0); return res;
}
if (k == 3) {
res.pb(1), res.pb(0); return res;
}
res = construct_permutation(k/4);
int l = res.size();
if ((k%4) == 0) {
res.pb(l), res.pb(l+1);
}
else if ((k%4) == 1) {
for (int &x : res) x++;
res.pb(l+1), res.pb(l+2), res.pb(0);
}
else if ((k%4) == 2) {
for (int &x : res) x++;
res.pb(l+1), res.pb(0), res.pb(l+2);
}
else {
bool flag;
for (int x : res) {
if (x <= 1) {
flag = x; break;
}
}
if (flag) {
for (int &x : res) {
if (x > 1) x++;
}
res.pb(l+1), res.pb(l+2), res.pb(2);
}
else {
for (int &x : res) x += 2;
res.pb(l+2), res.pb(1), res.pb(l+3), res.pb(0);
}
}
return res;
}
// int32_t main() {
// ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// return 0;
// }