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>;
#define pb push_back
#define ff first
#define ss second
vector<int> construct_permutation(ll k){
vector<int> p;
int cc = 0;
if (k % 2){
p.pb(1e9);
p.pb(cc++);
k = (k - 1) / 2 - 1;
}
else {
p.pb(cc++);
k = k / 2 - 1;
}
while (k > 0){
if (k % 2){
p.pb(cc++);
k = (k - 1) / 2;
}
else {
p.pb(1e9);
p.pb(cc++);
k = k / 2 - 1;
}
}
for (int i = (int) p.size() - 1; i >= 0; i--){
if (p[i] == 1e9){
p[i] = cc++;
}
}
return p;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |