# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1164075 | just | Permutation (APIO22_perm) | C++20 | 7 ms | 1096 KiB |
#include "bits/stdc++.h"
using namespace std;
#define all(x) (x).begin(), (x).end()
#define vec vector
#define int long long
vec<int> solve(int k) {
// if (k <= 90) {
// k--;
// vec<int> ans(k);
// iota(all(ans), 0);
// reverse(all(ans));
// return ans;
// }
// k--; // empty subsequence
vec<int> pows; int sum = 0;
for(int i = 62; i >= 1; i--) {
int x = (1ll << i) - 1;
while (k > x) {
pows.push_back(i);
sum += i;
k -= x;
}
}
int n = sum;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |