# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
605423 | 2022-07-25T17:25:29 Z | AugustinasJucas | Permutation (APIO22_perm) | C++17 | 2 ms | 384 KB |
#include "perm.h" #include <bits/stdc++.h> using namespace std; vector<int> construct_permutation(long long k) { vector<int> init; int ind = 0; long long liko = 0; for(int i = 0; i < 64; i++) { long long bus = (1ll << i); if(bus > k) { // desim i-1 tu. for(int j = 0; j < i-1; j++) init.push_back(ind++); liko = k - (1ll << (i-1)); break; } } // cout << "liko = " << liko << ", popcnt = " << __builtin_popcount(liko) << endl; vector<int> ret; ind += __builtin_popcountll(liko) - 1; for(int i = 0; i < init.size(); i++) { if((1ll << i) & liko) { ret.push_back(ind); ind--; } ret.push_back(init[i]); } // cout << "ret = "; for(auto x : ret) cout << x << " "; //cout << endl; return ret; }
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 | 212 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Partially correct | 1 ms | 304 KB | Partially correct |
6 | Correct | 2 ms | 300 KB | Output is correct |
7 | Correct | 2 ms | 340 KB | Output is correct |
8 | Partially correct | 2 ms | 384 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 |