# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
708463 | Essa2006 | 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.
#include<bits/stdc++.h>
#include "perm.h"
using namespace std;
#define ll long long
#define endl '\n'
#define FF first
#define SS second
#define all(a) a.begin(), a.end()
#define mod (ll)(1000000007)
ll gr(ll n){
ll pr=0;
for(;pr<1e9;pr++){
if((1<<pr)>n)
break;
}
return pr-1;
}
vector<ll> construct_permutation(ll k){
ll j=k;
k--;
vector<ll>Base, Ans;
map<ll, priority_queue<ll>>mp;
ll las=0, cur=0;
Base.push_back(-1);
while(k){
ll mx=min(gr(k), las);
k-=1<<mx;
if(mx==las)
Base.push_back(cur++), las++;
else
mp[Base[mx]].push(cur++);
}
for(int i=0;i<Base.size();i++){
if(i)
Ans.push_back(Base[i]);
while(!mp[Base[i]].empty()){
Ans.push_back(mp[Base[i]].top());
mp[Base[i]].pop();
}
}
// cout<<j<<endl<<" ";
// for(int i=0;i<Ans.size();i++){
// cout<<Ans[i]<<' ';
// }
// cout<<endl;
return Ans;
}