# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
912275 | 2024-01-19T09:23:15 Z | TienDungz | Permutation (APIO22_perm) | C++17 | 0 ms | 0 KB |
// #include "perm.h" #include <bits/stdc++.h> using namespace std; std::vector<int> construct_permutation(long long n) { vector<int> res; int p = 0; for (int j = 60; j >= 0; j--) { int m = 1LL << j; if (n - m >= 0) { n -=m; if (ok) { ok = false; for (int i = 1; i <= j; i++) { res.push_back(2 * i); } p = j; } else { res.push_back(2 * j + 1); } } } return res; }