# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
979047 | 2024-05-10T07:06:46 Z | sunnat | Permutation (APIO22_perm) | C++17 | 1 ms | 348 KB |
#include <iostream> #include <vector> using namespace std; int count_zeros(long long k){ return k ? ((k&1)^1) + count_zeros(k>>1) : 0; } vector<int> construct_permutation(long long k){ --k; vector<int> a; while(count_zeros(k - ((1LL<<a.size())-1)) > a.size()) a.push_back(a.size()); k -= (1LL<<a.size()) - 1; for(int i = 0; k > 0; ++ i){ if((k>>i)&1){ a.insert(a.begin()+i, a.size()); k -= 1ll<<i; } } return a; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 1 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 1 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |