結果
問題 |
No.2866 yuusaan's Knapsack
|
ユーザー |
👑 |
提出日時 | 2024-08-31 13:11:17 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 18 ms / 2,000 ms |
コード長 | 3,130 bytes |
コンパイル時間 | 3,913 ms |
コンパイル使用メモリ | 252,856 KB |
最終ジャッジ日時 | 2025-02-24 03:31:41 |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 26 |
ソースコード
#include<bits/stdc++.h> #include<atcoder/all> #define rep(i,n) for(int i=0;i<n;i++) using namespace std; using namespace atcoder; typedef long long ll; typedef vector<int> vi; typedef vector<long long> vl; typedef vector<vector<int>> vvi; typedef vector<vector<long long>> vvl; typedef long double ld; typedef pair<int, int> P; ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;} template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;} template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;} template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;} template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;} template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;} template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;} template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;} template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;} template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;} template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;} template<typename T> void chmin(T& a, T b){a = min(a, b);} template<typename T> void chmax(T& a, T b){a = max(a, b);} const int M = 10000; const int INF = 1001001001; using mint = modint998244353; int main(){ int N, W; cin >> N >> W; vector<int> f(3 * M + 1, -INF); vector<mint> g(3 * M + 1); f[M] = 0; g[M] = 1; rep(n, N){ int v, w; cin >> v >> w; vector<int> f_old(3 * M + 1, -INF); vector<mint> g_old(3 * M + 1); swap(f, f_old); swap(g, g_old); for(int from = 0; from <= 3 * M; from++){ if(f[from] == f_old[from]){ g[from] += g_old[from]; } if(f[from] < f_old[from]){ f[from] = f_old[from]; g[from] = g_old[from]; } int to = from + w; if(to >= 0 and to <= 3 * M){ if(f[to] == f_old[from] + v){ g[to] += g_old[from]; } if(f[to] < f_old[from] + v){ f[to] = f_old[from] + v; g[to] = g_old[from]; } } } } int ans_f = -INF; mint ans_g = -INF; for(int w = 0; w <= M + W; w++){ if(f[w] == ans_f){ ans_g += g[w]; } if(f[w] > ans_f){ ans_f = f[w]; ans_g = g[w]; } } cout << ans_f << ' ' << ans_g << "\n"; return 0; }