結果
問題 |
No.951 【本日限定】1枚頼むともう1枚無料!
|
ユーザー |
|
提出日時 | 2024-06-21 18:23:33 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,421 ms / 2,000 ms |
コード長 | 3,185 bytes |
コンパイル時間 | 2,169 ms |
コンパイル使用メモリ | 155,900 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-21 18:24:17 |
合計ジャッジ時間 | 43,112 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 52 |
ソースコード
#include <algorithm> #include <cassert> #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <iostream> #include <numeric> #include <vector> #include <map> #include <set> #include <queue> #include <functional> #include <iomanip> using namespace std; using ll = long long; class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n; public:range(int n_):i({0}),n({n_}){}range(int i_,int n_):i({i_}),n({n_}){}I& begin(){return i;}I& end(){return n;}}; template<typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; } template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; } template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; } template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; } template<typename T> void take(vector<T>& vec, int n) { vec.resize(n); for (int i = 0; i < n; ++i) cin >> vec[i]; } #ifdef ONLINE_JUDGE #define dump(expr) ; #else #define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; } #endif namespace solver { template<typename T1, typename T2> struct In2 { T1 a; T2 b; friend std::istream& operator>>(std::istream& is, In2& obj) { T1 t1; T2 t2; is >> t1 >> t2; obj = {t1, t2}; return is; } }; template<typename T1, typename T2, typename T3> struct In3 { T1 a; T2 b; T3 c; friend std::istream& operator>>(std::istream& is, In3& obj) { T1 t1; T2 t2; T3 t3; is >> t1 >> t2 >> t3; obj = {t1, t2, t3}; return is; } }; int n, k; vector<In2<int, int>> vp; void read() { cin >> n >> k; take(vp, n); } template <typename T> T chmin(T& a, T b) { return a = min(a, b); } template <typename T> T chmax(T& a, T b) { return a = max(a, b); } using RetType = int; RetType run() { vector<pair<int, int>> pp(n); for (int i : range(n)) pp[i] = {vp[i].a, vp[i].b}; ranges::sort(pp); vector<vector<int>> dp(k + 1, vector<int>(2, 0)); for (auto p : pp) { vector<vector<int>> next(k + 1, vector<int>(2, 0)); for (int budget : range(k + 1)) { chmax(next[budget][0], dp[budget][0]); chmax(next[budget][1], dp[budget][1]); chmax(next[budget][0], dp[budget][1] + p.second); if (budget - p.first >= 0) { chmax(next[budget][1], dp[budget - p.first][0] + p.second); } } dump(next); dp.swap(next); } int res = 0; for (int budget : range(k + 1)) chmax(res, dp[budget][1]); return res; } } // namespace template <typename F> void run(F f) { if constexpr (std::is_same_v<decltype(f()), void>) f(); else cout << f() << endl; } int main(int argc, char** argv) { cerr << fixed << setprecision(12); cout << fixed << setprecision(12); int testcase = 1; if (argc > 1) testcase = atoi(argv[1]); while (testcase--) { solver::read(); } run(solver::run); }