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;
vector<int> construct_permutation(long long k) {
long long size = log2(k);
vector<int> perm(size);
for(int i = 0; i < size; i++){
perm[i] = i;
}
k-=(1 << size);
long long insert = size;
while(true){
if(k == 0){
break;
}
long long ind = log2(k);
k-=(1 << ind);
if(ind == 0){
perm.insert(perm.begin(), insert);
insert++;
continue;
}
perm.insert(perm.begin() + ind - 1, insert);
insert++;
}
return perm;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |