結果
問題 | No.2429 Happiest Tabehodai Ways |
ユーザー |
|
提出日時 | 2023-08-18 22:06:48 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 5 ms / 2,000 ms |
コード長 | 4,968 bytes |
コンパイル時間 | 1,861 ms |
コンパイル使用メモリ | 170,460 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-06-12 07:59:44 |
合計ジャッジ時間 | 3,548 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 44 |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;template<class T> istream& operator >> (istream& is, vector<T>& vec) {for(T& x : vec) is >> x;return is;}template<class T> ostream& operator << (ostream& os, const vector<T>& vec) {if(vec.empty()) return os;os << vec[0];for(auto it = vec.begin(); ++it != vec.end(); ) os << ' ' << *it;return os;}template<const unsigned int MOD> struct prime_modint {using mint = prime_modint;unsigned int v;prime_modint() : v(0) {}prime_modint(unsigned int a) { a %= MOD; v = a; }prime_modint(unsigned long long a) { a %= MOD; v = a; }prime_modint(int a) { a %= (int)(MOD); if(a < 0)a += MOD; v = a; }prime_modint(long long a) { a %= (int)(MOD); if(a < 0)a += MOD; v = a; }static constexpr int mod() { return MOD; }mint& operator++() {v++; if(v == MOD)v = 0; return *this;}mint& operator--() {if(v == 0)v = MOD; v--; return *this;}mint operator++(int) { mint result = *this; ++*this; return result; }mint operator--(int) { mint result = *this; --*this; return result; }mint& operator+=(const mint& rhs) { v += rhs.v; if(v >= MOD) v -= MOD; return *this; }mint& operator-=(const mint& rhs) { if(v < rhs.v) v += MOD; v -= rhs.v; return *this; }mint& operator*=(const mint& rhs) {v = (unsigned int)((unsigned long long)(v) * rhs.v % MOD);return *this;}mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }mint operator+() const { return *this; }mint operator-() const { return mint() - *this; }mint pow(long long n) const {assert(0 <= n);mint r = 1, x = *this;while (n) {if (n & 1) r *= x;x *= x;n >>= 1;}return r;}mint inv() const { assert(v); return pow(MOD - 2); }friend mint operator+(const mint& lhs, const mint& rhs) { return mint(lhs) += rhs; }friend mint operator-(const mint& lhs, const mint& rhs) { return mint(lhs) -= rhs; }friend mint operator*(const mint& lhs, const mint& rhs) { return mint(lhs) *= rhs; }friend mint operator/(const mint& lhs, const mint& rhs) { return mint(lhs) /= rhs; }friend bool operator==(const mint& lhs, const mint& rhs) { return (lhs.v == rhs.v); }friend bool operator!=(const mint& lhs, const mint& rhs) { return (lhs.v != rhs.v); }friend std::ostream& operator << (std::ostream &os, const mint& rhs) noexcept { return os << rhs.v; }};//using mint = prime_modint<1000000007>;using mint = prime_modint<998244353>;//enumeration<mint> enu(200000);のように宣言するtemplate<class T> struct enumeration{int N;vector<T> fact, inv;enumeration() : N(0), fact(1, 1), inv(1, 1) {}enumeration(int _n) : N(_n), fact(_n + 1), inv(_n + 1) {fact[0] = 1;for(int i = 1; i <= N; i++) fact[i] = fact[i - 1] * i;inv[N] = T(1) / fact[N];for(int i = N; i >= 1; i--) inv[i - 1] = inv[i] * i;}void expand(int lim){fact.resize(lim + 1);inv.resize(lim + 1);for(int i = N + 1; i <= lim; i++) fact[i] = i * fact[i - 1];inv[lim] = T(1) / fact[lim];for(int i = lim; i >= N + 2; i--) inv[i - 1] = i * inv[i];N = lim;}T Per(int n, int k){if(k > n) return 0;if(n > N) expand(n);return fact[n] * inv[n - k];}T C(int n, int k){if(n < 0 || k < 0 || k > n) return 0;if(n > N) expand(n);return fact[n] * inv[n - k] * inv[k];}T H(int n, int k){if(n ==0 && k == 0) return 1;if(n <= 0 || k < 0) return 0;return C(n + k - 1, k);}};// dp[食べた個数][満腹度]// Permutationの積だと同じ種類の料理で壊れる// 同じ料理をまとめる?// dp[i番目までで何個か食べた][満腹度]// TLEしそうだけど一回書いてみる// K でスキャン?int main(){ios::sync_with_stdio(false);cin.tie(0);int n, K;cin >> n >> K;vector<int> c(n), d(n);cin >> c >> d;//enumeration<mint> enu(K + 5);vector<int> dp(K + 1, -(1 << 30));vector<mint> dp2(K + 1);dp[0] = 0;dp2[0] = 1;for(int i = 0; i < K; i++){if(dp[i] < 0) continue;for(int j = 0; j < n; j++){int v1 = c[j], v2 = d[j];if(i + v1 <= K){if(dp[i] + v2 > dp[i + v1]){dp[i + v1] = dp[i] + v2;dp2[i + v1] = dp2[i];}else if(dp[i] + v2 == dp[i + v1]){dp2[i + v1] += dp2[i];}}}}int mx = -1;mint ans = 0;for(int i = K; i >= 0; i--){if(dp[i] > mx){mx = dp[i];ans = dp2[i];}else if(dp[i] == mx){ans += dp2[i];}}cout << mx << '\n';cout << ans << '\n';}