結果
問題 | No.2317 Expression Menu |
ユーザー | ktr216 |
提出日時 | 2023-05-26 21:47:17 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 238 ms / 2,000 ms |
コード長 | 4,196 bytes |
コンパイル時間 | 1,788 ms |
コンパイル使用メモリ | 180,040 KB |
実行使用メモリ | 226,300 KB |
最終ジャッジ日時 | 2023-08-26 11:06:33 |
合計ジャッジ時間 | 10,726 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 4 ms
10,044 KB |
testcase_01 | AC | 3 ms
10,036 KB |
testcase_02 | AC | 18 ms
25,500 KB |
testcase_03 | AC | 237 ms
226,076 KB |
testcase_04 | AC | 231 ms
226,128 KB |
testcase_05 | AC | 235 ms
226,140 KB |
testcase_06 | AC | 230 ms
226,072 KB |
testcase_07 | AC | 237 ms
226,136 KB |
testcase_08 | AC | 235 ms
226,128 KB |
testcase_09 | AC | 235 ms
226,144 KB |
testcase_10 | AC | 233 ms
226,300 KB |
testcase_11 | AC | 231 ms
226,128 KB |
testcase_12 | AC | 234 ms
226,104 KB |
testcase_13 | AC | 233 ms
226,100 KB |
testcase_14 | AC | 238 ms
226,168 KB |
testcase_15 | AC | 230 ms
226,076 KB |
testcase_16 | AC | 233 ms
226,020 KB |
testcase_17 | AC | 236 ms
226,100 KB |
testcase_18 | AC | 228 ms
226,140 KB |
testcase_19 | AC | 234 ms
226,180 KB |
testcase_20 | AC | 232 ms
226,136 KB |
testcase_21 | AC | 231 ms
226,024 KB |
testcase_22 | AC | 232 ms
226,132 KB |
testcase_23 | AC | 222 ms
226,044 KB |
testcase_24 | AC | 222 ms
226,024 KB |
testcase_25 | AC | 221 ms
226,020 KB |
testcase_26 | AC | 222 ms
226,136 KB |
testcase_27 | AC | 224 ms
226,176 KB |
testcase_28 | AC | 225 ms
226,140 KB |
testcase_29 | AC | 226 ms
226,020 KB |
testcase_30 | AC | 225 ms
226,016 KB |
testcase_31 | AC | 223 ms
226,100 KB |
testcase_32 | AC | 223 ms
226,144 KB |
testcase_33 | AC | 4 ms
9,852 KB |
testcase_34 | AC | 3 ms
10,124 KB |
testcase_35 | AC | 5 ms
11,656 KB |
testcase_36 | AC | 3 ms
9,872 KB |
testcase_37 | AC | 3 ms
10,184 KB |
testcase_38 | AC | 204 ms
226,068 KB |
testcase_39 | AC | 203 ms
226,072 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #define double long double using ll = long long; using VB = vector<bool>; using VVB = vector<VB>; using VVVB = vector<VVB>; using VC = vector<char>; using VVC = vector<VC>; using VI = vector<int>; using VVI = vector<VI>; using VVVI = vector<VVI>; using VVVVI = vector<VVVI>; using VL = vector<ll>; using VVL = vector<VL>; using VVVL = vector<VVL>; using VVVVL = vector<VVVL>; using VD = vector<double>; using VVD = vector<VD>; using VVVD = vector<VVD>; //using P = pair<int, int>; #define REP(i, n) for (ll i = 0; i < (int)(n); i++) #define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++) #define ALL(a) (a).begin(),(a).end() constexpr int INF = 1001001001; constexpr ll LINF = 1001001001001001001ll; constexpr int DX[] = {2, 1, -1, -2, -2, -1, 1, 2}; constexpr int DY[] = {1, 2, 2, 1, -1, -2, -2, -1}; template< typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true); } template< typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true); } const ll MOD = 998244353; const int MAX_N = 400010; int par[MAX_N]; int rnk[MAX_N]; int siz[MAX_N]; void init(int n) { REP(i,n) { par[i] = i; rnk[i] = 0; siz[i] = 1; } } int find(int x) { if (par[x] == x) { return x; } else { return par[x] = find(par[x]); } } void unite(int x, int y) { x = find(x); y = find(y); if (x == y) return; int s = siz[x] + siz[y]; if (rnk[x] < rnk[y]) { par[x] = y; } else { par[y] = x; if (rnk[x] == rnk[y]) rnk[x]++; } siz[find(x)] = s; } bool same(int x, int y) { return find(x) == find(y); } int size(int x) { return siz[find(x)]; } ll mod_pow(ll x, ll n, ll mod) { ll res = 1; x %= mod; while (n > 0) { if (n & 1) res = res * x % mod; x = x * x % mod; n >>= 1; } return res; } ll gcd(ll x, ll y) { if (y == 0) return x; return gcd(y, x % y); } typedef pair<ll, int> P0; struct edge { int to; ll cost; }; const int MAX_V = 200000; //const ll LINF = 1LL<<60; int V; vector<edge> G[MAX_V]; ll d[MAX_V]; void dijkstra(ll s) { priority_queue<P0, vector<P0>, greater<P0> > que; fill(d, d + V, LINF); d[s] = 0; que.push(P0(0, s)); while (!que.empty()) { P0 p = que.top(); que.pop(); int v = p.second; if (d[v] < p.first) continue; for (edge e : G[v]) { if (d[e.to] > d[v] + e.cost) { d[e.to] = d[v] + e.cost; que.push(P0(d[e.to], e.to)); } } } } /* double EPS = 1e-10; double add(double a, double b) { if (abs(a + b) < EPS * (abs(a) + abs(b))) return 0; return a + b; } struct P { double x, y; P() {} P(double x, double y) : x(x), y(y) { } P operator + (P p) { return P(add(x, p.x), add(y, p.y)); } P operator - (P p) { return P(add(x, -p.x), add(y, -p.y)); } P operator * (double d) { return P(x * d, y * d); } double dot(P p) { return add(x * p.x, y * p.y); } double det(P p) { return add(x * p.y, -y * p.x); } }; bool on_seg(P p1, P p2, P q) { return () } P intersection(P p1, P p2, P q1, P q2) { return p1 + (p2 - p1) * ((q2 - q1).det(q1 - p1) / (q2 - q1).det(p2 - p1)); } */ /* VL f(400010, 1); ll C(ll n, ll k) { return f[n] * mod_pow(f[k], MOD - 2, MOD) % MOD * mod_pow(f[n - k], MOD - 2, MOD) % MOD; } */ int main() { ios::sync_with_stdio(false); std::cin.tie(nullptr); //REP(i, 400009) f[i + 1] = f[i] * (i + 1) % MOD; int N, X, Y; cin >> N >> X >> Y;; VI A(N), B(N), C(N); REP(i, N) cin >> A[i] >> B[i] >> C[i]; VVVL dp(N + 1, VVL(X + 1, VL(Y, -LINF))); dp[0][0][0] = 0; ll ans = 0; REP(i, N) REP(j, X + 1) REP(k, Y + 1) { if (dp[i][j][k] == -LINF) continue; chmax(dp[i + 1][j][k], dp[i][j][k]); if (j + A[i] <= X && k + B[i] <= Y) { chmax(dp[i + 1][j + A[i]][k + B[i]], dp[i][j][k] + C[i]); chmax(ans, dp[i + 1][j + A[i]][k + B[i]]); } } cout << ans << endl; }