| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1362444 | aaaaaaaa | Permutation (APIO22_perm) | C++20 | 43 ms | 12484 KiB |
#include <bits/stdc++.h>
#include "perm.h"
using namespace std;
vector<int> construct_permutation(long long k) {
long long len = 0;
for (long long i = 1; i <= 60; ++i) {
if ((1ll << i) <= k) {
len = i;
}
}
// cout << len << " " << (1ll << len) << "\n";
deque <long long> q;
for (long long i = 0; i < len; ++i) q.push_back(i);
long long rem = k - (1ll << len);
for (long long i = len; i <= len + rem - 1; ++i) {
q.push_front(i);
}
vector <int> ans;
for (auto v : q) ans.push_back(v);
return ans;
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
