# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
916502 | 2024-01-26T02:42:11 Z | wii | Permutation (APIO22_perm) | C++17 | 2 ms | 684 KB |
#include <bits/stdc++.h> #include <perm.h> using namespace std; void dnc(deque<int> &v, int id, long long u) { if (id < 0) return; if (u & 1) { dnc(v, id - 1, u >> 1); v.push_back(id); } else { dnc(v, id - 1, u - 1); v.push_front(id); } } vector<int> construct_permutation(long long k) { k -= 1; int cnt = 0; for (long long x = k; x > 0; x = (~x & 1 ? --x : x >> 1), ++cnt); deque<int> ans; dnc(ans, cnt - 1, k); return vector<int>(ans.begin(), ans.end()); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 1 ms | 348 KB | Output is correct |
4 | Correct | 1 ms | 344 KB | Output is correct |
5 | Partially correct | 2 ms | 348 KB | Partially correct |
6 | Correct | 2 ms | 480 KB | Output is correct |
7 | Correct | 1 ms | 348 KB | Output is correct |
8 | Partially correct | 1 ms | 344 KB | Partially correct |
9 | Correct | 1 ms | 348 KB | Output is correct |
10 | Partially correct | 2 ms | 344 KB | Partially correct |
11 | Partially correct | 1 ms | 348 KB | Partially correct |
12 | Partially correct | 1 ms | 348 KB | Partially correct |
13 | Partially correct | 2 ms | 684 KB | Partially correct |