結果
問題 | No.3076 Goodstuff Deck Builder |
ユーザー |
👑 |
提出日時 | 2025-02-10 20:08:50 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 88 ms / 3,000 ms |
コード長 | 2,907 bytes |
コンパイル時間 | 4,475 ms |
コンパイル使用メモリ | 258,620 KB |
実行使用メモリ | 7,324 KB |
最終ジャッジ日時 | 2025-03-28 20:50:10 |
合計ジャッジ時間 | 6,940 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 36 |
ソースコード
#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; 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 <int m> istream& operator>>(istream& is, static_modint<m>& a) {long long x; is >> x; a = x; return is;} template <int m> istream& operator>>(istream& is, dynamic_modint<m>& a) {long long x; is >> x; a = x; return is;} 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 K = 10; int main(){ int N, M; cin >> N >> M; vector<pair<int, int>> hand; long long ans1 = 0; rep(i, N){ int C, D; cin >> C >> D; if(C == 0) ans1 += D; else hand.emplace_back(C, D); } sort(hand.rbegin(), hand.rend()); vector<vector<long long>> dp(K + 1, vector<long long>(M + 1, 0LL)); for(auto [_C, D] : hand){ for(int i = K - 1; i >= 0; i--){ int C = (_C << i); for(int j = M - C; j >= 0; j--){ chmax(dp[i + 1][j + C], dp[i][j] + D); } } } long long ans2 = 0; for(int i = 0; i <= K; i++) for(int j = 0; j <= M; j++) chmax(ans2, dp[i][j]); cout << ans1 + ans2 << "\n"; return 0; }