結果
問題 | No.2846 Birthday Cake |
ユーザー |
![]() |
提出日時 | 2024-08-23 22:49:48 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 516 ms / 2,000 ms |
コード長 | 4,708 bytes |
コンパイル時間 | 4,022 ms |
コンパイル使用メモリ | 286,312 KB |
実行使用メモリ | 8,192 KB |
最終ジャッジ日時 | 2024-08-23 22:49:59 |
合計ジャッジ時間 | 9,838 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 34 |
ソースコード
#if __INCLUDE_LEVEL__ == 0 #include __BASE_FILE__ template <class Mint> Mint Go(int K, int n) { vector<int64_t> L(n + 1, 1); for (int i : Rep1(1, n)) { L[i] = lcm(L[i - 1], i); } Comb<Mint> comb(n); vector<map<int64_t, Mint>> f(K + 1); f[0][0] = comb.fact(K); for (int i : Rev(Rep1(1, n))) { for (int k : Rev(Rep(0, K))) { for (auto [x, y] : f[k]) { for (int nk : Rep1(k + 1, K)) { int64_t nx = x + L[n] / i * (nk - k); if (nx <= L[n] && nx % (L[n] / L[i - 1]) == 0) { f[nk][nx] += y * comb.recip_fact(nk - k); } } } } } return f[K][L[n]]; } void Solve() { int K, n; IN(K, n); long long r0 = Go<atcoder::modint998244353>(K, n).val(); long long r1 = Go<atcoder::modint1000000007>(K, n).val(); OUT(atcoder::crt({r0, r1}, {998244353, 1000000007}).first); } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); Solve(); } #elif __INCLUDE_LEVEL__ == 1 #include <bits/stdc++.h> #include <atcoder/math> #include <atcoder/modint> template <class T> std::vector<T> make_vector_for_overwrite(int n) { static_assert(std::is_trivially_destructible_v<T>); std::vector<T> v; static_assert(sizeof(v) == 3 * sizeof(T*)); v.reserve(n); T*(&a)[3] = reinterpret_cast<T*(&)[3]>(v); assert(a[0] == a[1] && a[1] + n == a[2]); a[1] = a[2]; return v; } template <class T> class Comb { public: Comb() = default; explicit Comb(int max_n) : fact_(make_vector_for_overwrite<T>(max_n + 1)), recip_fact_(make_vector_for_overwrite<T>(max_n + 1)) { fact_[0] = 1; for (const int n : std::views::iota(1, max_n + 1)) { fact_[n] = fact_[n - 1] * n; } recip_fact_[max_n] = 1 / fact_[max_n]; for (const int n : std::views::iota(1, max_n + 1) | std::views::reverse) { recip_fact_[n - 1] = n * recip_fact_[n]; } } T recip(int n) const { assert(n); return n < 0 ? -recip(-n) : recip_fact_[n] * fact_[n - 1]; } T fact(int n) const { assert(0 <= n); return fact_[n]; } T recip_fact(int n) const { return n < 0 ? 0 : recip_fact_[n]; } T falling_fact(int n, int k) const { assert(0 <= n || n < k); if (n < 0) { const T t = falling_fact(k - n - 1, k); return k & 1 ? -t : t; } return n < k ? 0 : recip_fact(n - k) * fact(n); } T recip_falling_fact(int n, int k) const { assert(n < 0 || k <= n); return falling_fact(n - k, -k); } T rising_fact(int n, int k) const { assert(n <= 0 || 0 < n + k); return falling_fact(n + k - 1, k); } T recip_rising_fact(int n, int k) const { assert(0 < n || n + k <= 0); return falling_fact(n - 1, -k); } T binom(int n, int k) const { if ((n < 0) ^ (k < 0) ^ (n < k)) { return 0; } if (n < 0 && k < 0) { k = n - k; } return recip_fact(k) * falling_fact(n, k); } T recip_binom(int n, int k) const { assert((0 <= n) ^ (0 <= k) ^ (k <= n)); k = std::max(k, n - k); return recip_falling_fact(n, k) * fact(k); } T multiset(int n, int k) const { return binom(n + k - 1, k); } T recip_multiset(int n, int k) const { assert((0 < n) ^ (0 <= k) ^ (0 < n + k)); return recip_binom(n + k - 1, k); } private: std::vector<T> fact_; std::vector<T> recip_fact_; }; template <class T> concept Range = std::ranges::range<T> && !std::convertible_to<T, std::string_view>; template <class T> concept Tuple = std::__is_tuple_like<T>::value && !Range<T>; namespace std { istream& operator>>(istream& is, Range auto&& r) { for (auto&& e : r) is >> e; return is; } istream& operator>>(istream& is, Tuple auto&& t) { apply([&](auto&... xs) { (is >> ... >> xs); }, t); return is; } ostream& operator<<(ostream& os, Range auto&& r) { auto sep = ""; for (auto&& e : r) os << exchange(sep, " ") << e; return os; } ostream& operator<<(ostream& os, Tuple auto&& t) { auto sep = ""; apply([&](auto&... xs) { ((os << exchange(sep, " ") << xs), ...); }, t); return os; } template <class T, atcoder::internal::is_modint_t<T>* = nullptr> istream& operator>>(istream& is, T& x) { int v; is >> v; x = T::raw(v); return is; } template <class T, atcoder::internal::is_modint_t<T>* = nullptr> ostream& operator<<(ostream& os, const T& x) { return os << x.val(); } } // namespace std using namespace std; #define Rev views::reverse #define Rep(...) [](int l, int r) { return views::iota(min(l, r), r); }(__VA_ARGS__) #define Rep1(...) [](int l, int r) { return Rep(l, r + 1); }(__VA_ARGS__) #define IN(...) cin >> forward_as_tuple(__VA_ARGS__) #define OUT(...) cout << forward_as_tuple(__VA_ARGS__) << '\n' #endif // __INCLUDE_LEVEL__ == 1