# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
594650 | mohammad_kilani | Permutation (APIO22_perm) | C++17 | 2 ms | 340 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 <bits/stdc++.h>
using namespace std;
std::vector<int> construct_permutation(long long k){
vector< int > ret;
int mx = 0;
while((1LL << (mx + 1)) <= k)
mx++;
int a = 0;
for(int i = 0 ;i <= mx;i++){
if(((k >> i) & 1) == 1)
a++;
}
if(a <= 30){
for(int i = 0 ;i < mx;i++)
ret.push_back(i);
k -= (1LL << mx);
for(int i = mx - 1 ;i >= 0;i--){
if(((k >> i) & 1) == 1)
ret.insert(ret.begin() + i , (int)ret.size());
}
return ret;
}
vector< int > v;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |