| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1358716 | vahagng | Permutation (APIO22_perm) | C++20 | 1 ms | 344 KiB |
#include "perm.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> construct_permutation(long long k){
vector<int> res;
int mx = -1;
for(int i = 61; i >= 0; i--){
if(k & (1ll << i)){
mx = i;
break;
}
}
res.resize(mx);
iota(res.begin(), res.end(), 0);
int cur = mx;
for(int i = mx - 1; i >= 0; i--){
if(k & (1ll << i)){
res.insert(res.begin() + i, cur++);
}
}
return res;
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
