# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
579800 | 2022-06-19T22:13:42 Z | peuch | Permutation (APIO22_perm) | C++17 | 1000 ms | 304 KB |
#include "perm.h" #include<bits/stdc++.h> using namespace std; std::vector<int> construct_permutation(long long k) { if(k == 1) return vector<int> (0); if(k == 2) return vector<int> (1); vector<int> ret; for(int i = 2; i * i <= k; i++){ if(k % i != 0) continue; vector<int> aux1 = construct_permutation(i); vector<int> aux2 = construct_permutation(k / i); if(ret.empty() || aux1.size() + aux2.size() < ret.size()){ ret.clear(); for(int i = 0; i < aux1.size(); i++) ret.push_back(aux1[i]); for(int i = 0; i < aux2.size(); i++) ret.push_back(aux2[i] + aux1.size()); } } if(ret.empty()){ ret = construct_permutation(k - 1); ret.insert(ret.begin(), ret.size()); } return ret; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 256 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 256 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 55 ms | 304 KB | Output is correct |
4 | Execution timed out | 1098 ms | 212 KB | Time limit exceeded |
5 | Halted | 0 ms | 0 KB | - |