# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
573143 | 2022-06-06T04:44:10 Z | dqhungdl | Permutation (APIO22_perm) | C++17 | 2 ms | 352 KB |
#include "perm.h" #include <bits/stdc++.h> using namespace std; int getBit(long long x, int k) { return (x >> k) & 1LL; } vector<int> construct_permutation(long long k) { if (!k) return {}; int last = 0; for (int i = 0; i <= 60; i++) if (getBit(k, i)) last = i; vector<int> rs(last); iota(rs.begin(), rs.end(), 0); for (int i = last - 1; i >= 0; i--) if (getBit(k, i)) { for (int j = i; j < rs.size(); j++) rs[j]++; rs.push_back(i); } // for (int x: rs) // cout << x << ' '; // cout << '\n'; return rs; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Partially correct | 1 ms | 340 KB | Partially correct |
6 | Correct | 1 ms | 340 KB | Output is correct |
7 | Correct | 1 ms | 352 KB | Output is correct |
8 | Partially correct | 2 ms | 340 KB | Partially correct |
9 | Correct | 1 ms | 304 KB | Output is correct |
10 | Partially correct | 2 ms | 340 KB | Partially correct |
11 | Partially correct | 2 ms | 340 KB | Partially correct |
12 | Partially correct | 1 ms | 340 KB | Partially correct |
13 | Partially correct | 1 ms | 296 KB | Partially correct |