# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
874691 | serifefedartar | Permutation (APIO22_perm) | C++17 | 2 ms | 852 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>
#include <perm.h>
using namespace std;
#define fast ios::sync_with_stdio(0);cin.tie(0);
#define s second
#define f first
typedef long long ll;
const ll MOD = 1e9+7;
const ll LOGN = 20;
const ll MAXN = 1e5 + 100;
vector<int> construct_permutation(ll k) {
deque<int> v;
bool yes = false;
int last = 1;
for (ll i = 60; i >= 0; i--) {
if ((1LL<<i) & k) {
if (!yes) {
yes = true;
v.push_back(1);
} else {
last++;
v.push_front(last);
last++;
if (i != 0)
v.push_back(last);
}
} else if (yes) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |