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 "perm.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<int> construct_permutation(long long k)
{
vector <int> res;
int len = log2(k);
vector <int> a;
for (int i=1; i<=len; i++) a.push_back(i-1);
k-=(1LL<<len);
while (k>0)
{
int it = 0;
while ((1LL<<(it+1))<= k)
{
it++;
}
k-= (1LL<<it);
a.push_back(it);
}
int n=a.size();
vector <int> d(n+1,0);
for (int i=0; i<n; i++) d[a[i]] ++;
for (int i=1; i<=n; i++) d[i]+=d[i-1];
res.resize(n);
for (int i=0; i<n; i++) res[i] = --d[a[i]];
// for (int i:a) cerr<<i<<' '; cerr<<endl;
// for (int i:res) cerr<<i<<' '; cerr<<endl;
return res;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |