제출 #602980

#제출 시각아이디문제언어결과실행 시간메모리
602980tutis순열 (APIO22_perm)C++17
91.67 / 100
278 ms488 KiB
#include "perm.h" using namespace std; #include <iostream> #include <random> #include <functional> using ll = long long; std::vector<int> construct_permutation(long long k) { vector<int>ret = { -1}; vector<ll>dp = {1}; k--; while (k != 0) { vector<int>ret_ = ret; vector<ll>dp_ = dp; ll k_ = k; function<void(int)>dfs = [&](int l) { if (k < k_ || (k == k_ && dp.size() < dp_.size())) { k_ = k; dp_ = dp; ret_ = ret; } if (l == 0) return; int sz = (int)ret.size(); int gal = 0; 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) { gal++; if (gal >= 3) break; k -= sum; dp.push_back(sum); for (int &j : ret) if (j >= i) j++; ret.push_back(i); dfs(l - 1); k += sum; dp.pop_back(); ret.pop_back(); for (int &j : ret) if (j >= i) j--; } } }; dfs(6); ret = ret_; dp = dp_; k = k_; } ret.erase(ret.begin()); return ret; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...