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;
#define ll long long
vector<int> construct_permutation(ll k){
ll pow2[60];
pow2[0]=1LL;
for(int i=1;i<60;i++) pow2[i]=2LL*pow2[i-1];
vector<int> bnry;
int e=59;
while(pow2[e]>k) e--;
while(e>=0){
if(k>=pow2[e]){
k-=pow2[e];
bnry.push_back(1);
} else bnry.push_back(0);
e--;
}
int mn=-1;
int mx=0;
vector<int> ans;
int m=(int) bnry.size();
for(int i=1;i<m;i++){
if(bnry[i]==0){
ans.push_back(mx);
mx++;
} else{
ans.push_back(mx);
mx++;
ans.push_back(mn);
mn--;
}
}
int l=ans.size();
for(int i=0;i<l;i++){
ans[i]-=(mn+1);
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |