# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
873262 | salmon | Permutation (APIO22_perm) | C++17 | 2 ms | 508 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;
vector<int> construct_permutation(long long k){
if(k <= 90){
vector<int> v;
for(int i = 0; i < k - 1; i++){
v.push_back(i);
}
reverse(v.begin(),v.end());
return v;
}
vector<int> v;
vector<int> temp;
vector<int> bits;
bool flag = false;
while(k != 0){
bits.push_back(k % 2);
k /= 2;
}
bits.pop_back();
reverse(bits.begin(),bits.end());
if(bits[0] == 1){
flag = true;
v.push_back(1);
v.push_back(0);
}
else{
v.push_back(0);
}
for(int i = 1; i < bits.size(); i++){
if(flag){
if(bits[i] == 1 && i < bits.size() - 1 && bits[i + 1] == 1){
for(int i = 0; i < v.size(); i++){
if(v[i] >= 2){
v[i]++;
}
}
v.push_back(v.size() + 1);
v.push_back(v.size() + 1);
v.push_back(2);
i++;
}
else if(bits[i] == 0){
v.push_back(v.size());
}
else{
temp.clear();
temp.push_back(v.size() + 1);
for(int i : v){
temp.push_back(i);
}
temp.push_back(v.size());
v = temp;
}
}
else{
if(bits[i] == 0){
temp.clear();
temp.push_back(0);
for(int i : v){
temp.push_back(i + 1);
}
v = temp;
}
else{
temp.clear();
temp.push_back(1);
for(int i : v){
temp.push_back(i + 2);
}
temp.push_back(0);
v = temp;
flag = true;
}
}
}
return v;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |