제출 #266288

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
266288		dolphingarlic	Two Dishes (JOI19_dishes)	C++14	10 / 100	39 ms	31992 KiB

dishes

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

ll a[2001], b[2001], s[2001], t[2001], p[2001], q[2001];
ll dp[2001][2001];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> a[i] >> s[i] >> p[i];
        a[i] += a[i - 1];
    }
    for (int i = 1; i <= m; i++) {
        cin >> b[i] >> t[i] >> q[i];
        b[i] += b[i - 1];
    }
    for (int i = 1; i <= n; i++) dp[i][0] = dp[i - 1][0] + p[i] * (a[i] <= s[i]);
    for (int i = 1; i <= m; i++) dp[0][i] = dp[0][i - 1] + q[i] * (b[i] <= t[i]);
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            dp[i][j] = max(dp[i - 1][j] + p[i] * (a[i] + b[j] <= s[i]), dp[i][j - 1] + q[j] * (a[i] + b[j] <= t[j]));
        }
    }
    cout << dp[n][m];
    return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 3 / 3
• Subtask 3: 7 / 7
• Subtask 4: 0 / 39
• Subtask 5: 0 / 11
• Subtask 6: 0 / 9
• Subtask 7: 0 / 17
• Subtask 8: 0 / 9