Submission #619567

#TimeUsernameProblemLanguageResultExecution timeMemory
619567LoboPermutation (APIO22_perm)C++17
100 / 100
3 ms372 KiB
#include<bits/stdc++.h> #include "perm.h" using namespace std; #define vi vector<int> #define ll long long #define pb push_back #define all(x) x.begin(),x.end() vi construct_permutation(ll k) { if(k == 1) return {}; if(k == 2) return vi{0}; for(int i: {2, 3, 5, 7, 11, 13, 17, 19, 23, 29}) { if(k % i == 0 && k > i) { vi l = construct_permutation(k / i); vi r = construct_permutation(i); for(auto& x: r) x += l.size(); l.insert(l.end(), all(r)); return l; } } vi a = construct_permutation(k / 2); a.pb(a.size()); if(k & 1) a.insert(a.begin(), a.size()); return a; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...