# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
635909 | 2022-08-27T11:11:09 Z | Minindu2006 | Permutation (APIO22_perm) | C++17 | 2 ms | 340 KB |
#include "perm.h" #include <bits/stdc++.h> using namespace std; #define ll long long vector<int> ind(ll k) { vector<int> v; while(k > 0) { v.push_back(k % 2); k /= 2; } vector<int> ans; for(int i=0;i<v.size();i++) { if(v[i]) ans.push_back(i); } return ans; } std::vector<int> construct_permutation(long long k) { vector<int> cur = ind(k), ans; int n = cur.size(); for(int i=0;i<cur[n - 1];i++) ans.push_back(i); if(n == 1) return ans; cur.pop_back(); reverse(cur.begin(), cur.end()); int nxt = cur[n - 1]; for(int i=0;i<n - 1;i++) { ans.insert(ans.begin() + cur[i], nxt); nxt++; } return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 340 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 | 300 KB | Output is correct |
8 | Partially correct | 1 ms | 340 KB | Partially correct |
9 | Correct | 1 ms | 340 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 | 2 ms | 340 KB | Partially correct |
13 | Partially correct | 2 ms | 340 KB | Partially correct |