# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
658297 | Zena_Hossam | 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"
#include "grader.cpp"
#define ll int
using namespace std;
std::vector<long long> construct_permutation(long long k)
{
vector<pair<ll,ll>>v;
vector<ll>s,x;
long long l=1;
for(ll i=0;i<1e18;i++)
{
v.push_back({l-1,i});
l*=2;
if(l-1>1e18)break;
}
ll p=k-2;k--;
while(1)
{
pair<ll,ll>h={k,0};
ll o=lower_bound(v.begin(),v.end(),h)-v.begin();
if(v[o].first>k)o--;
for(ll i=p-v[o].second+1;i<=p;i++){
s.push_back(i);
}
// cout<<v[o].first<<" "<<v[o].second<<" "<<k<<"\n";
p-=v[o].second;
k-=v[o].first;
if(k<=0)break;
}x=s;
sort(x.begin(),x.end());
map<ll,ll>m;
for(ll i=0;i<x.size();i++)
{
m[x[i]]=i;
}
for(ll i=0;i<x.size();i++)
{
s[i]=m[s[i]];
}
return s;
}