結果
問題 | No.2317 Expression Menu |
ユーザー |
|
提出日時 | 2023-07-02 18:25:52 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 181 ms / 2,000 ms |
コード長 | 3,195 bytes |
コンパイル時間 | 3,667 ms |
コンパイル使用メモリ | 240,488 KB |
実行使用メモリ | 216,804 KB |
最終ジャッジ日時 | 2024-07-16 14:14:58 |
合計ジャッジ時間 | 11,024 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 37 |
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>typedef long long int ll;using namespace std;typedef pair<ll, ll> P;using namespace atcoder;template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;#define USE998244353#ifdef USE998244353const ll MOD = 998244353;// const double PI = 3.141592653589;using mint = modint998244353;#elseconst ll MOD = 1000000007;using mint = modint1000000007;#endifconst int MAX = 20000001;long long fac[MAX], finv[MAX], inv[MAX];void COMinit() {fac[0] = fac[1] = 1;finv[0] = finv[1] = 1;inv[1] = 1;for (int i = 2; i < MAX; i++){fac[i] = fac[i - 1] * i % MOD;inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;finv[i] = finv[i - 1] * inv[i] % MOD;}}long long COM(int n, int k){if (n < k) return 0;if (n < 0 || k < 0) return 0;return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;}ll gcd(ll x, ll y) {if (y == 0) return x;else if (y > x) {return gcd (y, x);}else return gcd(x % y, y);}ll lcm(ll x, ll y) {return x / gcd(x, y) * y;}ll my_sqrt(ll x) {//ll m = 0;ll M = 3000000001;while (M - m > 1) {ll now = (M + m) / 2;if (now * now <= x) {m = now;}else {M = now;}}return m;}ll keta(ll num, ll arity) {ll ret = 0;while (num) {num /= arity;ret++;}return ret;}ll ceil(ll n, ll m) {// n > 0, m > 0ll ret = n / m;if (n % m) ret++;return ret;}ll pow_ll(ll x, ll n) {if (n == 0) return 1;if (n % 2) {return pow_ll(x, n - 1) * x;}else {ll tmp = pow_ll(x, n / 2);return tmp * tmp;}}vector<ll> compress(vector<ll>& v) {// [3 5 5 6 1 1 10 1] -> [1 2 2 3 0 0 4 0]vector<ll> u = v;sort(u.begin(), u.end());u.erase(unique(u.begin(),u.end()),u.end());map<ll, ll> mp;for (int i = 0; i < u.size(); i++) {mp[u[i]] = i;}for (int i = 0; i < v.size(); i++) {v[i] = mp[v[i]];}return v;}ll dp[301][301][301];int main() {ll n;cin >> n;ll x, y;cin >> x >> y;for (int i = 0; i <= 300; i++){for (int j = 0; j <= 300; j++){for (int k = 0; k <= 300; k++) {dp[i][j][k] = 0;}}}ll a[n + 1];ll b[n + 1];ll c[n + 1];for (int i = 1; i <= n; i++) cin >> a[i] >> b[i] >> c[i];for (int i = 0; i < n; i++) {for (int j = 0; j <= 300; j++) {for (int k = 0; k <= 300; k++) {// no-usedp[i + 1][j][k] = max(dp[i + 1][j][k], dp[i][j][k]);// useif (j + a[i + 1] > 300) continue;if (k + b[i + 1] > 300) continue;dp[i + 1][j + a[i + 1]][k + b[i + 1]] = max(dp[i + 1][j + a[i + 1]][k + b[i + 1]], dp[i][j][k] + c[i + 1]);}}}ll ans = 0;for (int j = 0; j <= x; j++) {for (int k = 0; k <= y; k++) {ans = max(ans, dp[n][j][k]);}}cout << ans << endl;return 0;}