제출 #602995

#제출 시각아이디문제언어결과실행 시간메모리
602995tutis순열 (APIO22_perm)C++17
91.33 / 100
26 ms344 KiB
#include "perm.h" using namespace std; #include <iostream> #include <random> #include <functional> #include <map> using ll = long long; map<ll, vector<int>>M; std::vector<int> construct_permutation(long long k) { if (k % 2 == 0) { vector<int>a = construct_permutation(k / 2); a.push_back((int)a.size()); return a; } vector<int>ret = { -1}; vector<ll>dp = {1}; k--; while (k != 0) { int sz = (int)ret.size(); for (int i = sz - 1; i >= 0; i--) { ll sum = 0; for (int j = 0; j < (int)ret.size(); j++) if (ret[j] < i) sum += dp[j]; if (sum <= k) { k -= sum; dp.push_back(sum); for (int &j : ret) if (j >= i) j++; ret.push_back(i); break; } } } ret.erase(ret.begin()); return M[k] = ret; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...