# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
605435 | 2022-07-25T17:33:42 Z | AugustinasJucas | Permutation (APIO22_perm) | C++17 | 1000 ms | 1348 KB |
#include "perm.h" #include <bits/stdc++.h> using namespace std; vector<int> construct_permutation(long long k) { vector<int> RET(3000, 0); long long K = k; for(int H = 0; H < k-1; H++){ k = K - H; 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 + H; for(int i = 0; i < H; i++) { ret.push_back(ind--); } for(int i = 0; i < init.size(); i++) { if((1ll << i) & liko) { ret.push_back(ind); ind--; } ret.push_back(init[i]); } if(ret.size() < RET.size()) { RET = ret; } // 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 | 2 ms | 1348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 2 ms | 1348 KB | Output is correct |
3 | Execution timed out | 1078 ms | 532 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |