# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
786618 | mindiyak | Permutation (APIO22_perm) | C++17 | 4 ms | 596 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 "perm.h"
#include <cmath>
#include <deque>
#include <iostream>
#include <algorithm>
#define ll long long
#define pb push_back
using namespace std;
std::vector<int> construct_permutation(long long k)
{
if(k == 0){
return vector<int>(0);
}k--;
vector<ll> powers;
for(int i=0;i<63;i++){
// for(int i=0;i<10;i++){
powers.pb(pow(2,i)-1);
// cout << i << " " << powers[i] << endl;
}
deque<pair<int,int>> arr;
int n=0;
while(k > 0){
int length = upper_bound(powers.begin(),powers.end(),k) - powers.begin();
if(length != 0){
length --;
}
arr.push_front({n,n+length});
// cout << k << " " << n << " to " << n + length << " " << pow(2,length)-1 <<endl;
n += length;
k -= pow(2,length)-1;
}
vector<int> ans;
for(int i=0;i<arr.size();i++){
for(int j=arr[i].first;j<arr[i].second;j++){
ans.pb(j);
// cout << j << " ";
}
}
// cout << endl;
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |