結果
問題 | No.2317 Expression Menu |
ユーザー |
![]() |
提出日時 | 2023-05-26 21:33:36 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 310 ms / 2,000 ms |
コード長 | 2,308 bytes |
コンパイル時間 | 1,765 ms |
コンパイル使用メモリ | 203,732 KB |
最終ジャッジ日時 | 2025-02-13 05:58:47 |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 37 |
ソースコード
#include <bits/stdc++.h> //#include <atcoder/all> //using namespace atcoder; #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #define rep(i, n) for(ll i = 0; i < n; i++) #define rep2(i, m, n) for(ll i = m; i <= n; i++) #define rrep(i, m, n) for(ll i = m; i >= n; i--) #define all(a) a.begin(), a.end() #define rall(a) a.rbegin(), a.rend() #define MAX(x) *max_element(all(x)) #define MIN(x) *min_element(all(x)) #define SZ(a) ((ll)(a).size()) #define bit(n, k) ((n >> k) & 1) using namespace std; using ll = long long; using P = pair<ll, ll>; const int dx[4] = { 1, 0, -1, 0}; const int dy[4] = { 0, -1, 0, 1}; const int inf = 1e9 + 1; const ll infll = 1e18; //const double pi = acos(-1); using Graph = vector<vector<ll>>; using REV_PQ = priority_queue<ll, vector<ll>, greater<ll>>; using PQ = priority_queue<ll>; const int SIZE = 400010; ll powll(ll n, ll x) { // return n ^ x; ll ret = 1; rep(i, x) ret *= n; return ret; } void OutputYesNo(bool val) { if (val) cout << "Yes" << endl; else cout << "No" << endl; } void OutputTakahashiAoki(bool val) { if (val) cout << "Takahashi" << endl; else cout << "Aoki" << endl; } void OutPutInteger(ll x) { cout << x << endl; } void OutPutString(string x) { cout << x << endl; } int pop_count(ll n){ int ret = 0; while(n > 0){ if(n % 2 == 1) ret++; n /= 2; } return ret; } //using PAIR_REV_PQ = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>; //typedef atcoder::modint998244353 mint; //typedef atcoder::modint1000000007 mint; //typedef modint mint; //typedef vector<mint> ModintVec; //typedef vector<ModintVec> ModintMat; ll dp[310][310][310]; int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); ll n, x, y; cin >> n >> x >> y; vector<ll> a(n), b(n), c(n); rep(i, n) cin >> a[i] >> b[i] >> c[i]; rep(i, n){ rep2(j, 0, x)rep2(k, 0, y){ dp[i + 1][j][k] = max(dp[i + 1][j][k], dp[i][j][k]); if(j + a[i] > x || k + b[i] > y) continue; dp[i + 1][j + a[i]][k + b[i]] = max(dp[i + 1][j + a[i]][k + b[i]], dp[i][j][k] + c[i]); } } ll res = 0; rep2(j, 0, x)rep2(k, 0, y) res = max(res, dp[n][x][y]); cout << res << endl; }