제출 #1292566

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1292566		duongquanghai08	Cloud Computing (CEOI18_clo)	C++20	0 / 100	1 ms	572 KiB

clo

#include <bits/stdc++.h>
using namespace std;
const int N = 2002;
const int M = 100002;
const long long inf = 1e18 + 7;
struct Data {
    int c, f, v;
}a[2 * N];
int n, m;
long long dp[2][M];
void Solve() {
    cin >> n;
    int S = 0;
    for(int i = 1; i <= n; i++) {
        cin >> a[i].c >> a[i].f >> a[i].v;
        a[i].v = -a[i].v;
        S += a[i].c;
    }
    cin >> m;
    for(int i = n + 1; i <= n + m; i++) {
        cin >> a[i].c >> a[i].f >> a[i].v;
        a[i].c = -a[i].c;
    }
    n += m;
    sort(a + 1, a + n + 1, [&] (Data A, Data B) {
         if(A.f == B.f) return A.c > B.c;
         return A.f > B.f;
    });
    int pre = 0, cur = 1;
    for(int i = 0; i <= S; i++) dp[pre][i] = -inf;
    dp[pre][0] = 0;
    for(int i = 1; i <= n; i++) {
        cout << a[i].c << " " << a[i].f << " " << a[i].v << '\n';
        for(int j = 0; j <= S; j++) dp[cur][j] = -inf;
        for(int j = 0; j <= S; j++) {
            dp[cur][j] = max(dp[cur][j], dp[pre][j]);
            int nxt_j = j + a[i].c;
            if(nxt_j < 0 || nxt_j > S || dp[pre][j] == -inf) continue;
            dp[cur][nxt_j] = max(dp[cur][nxt_j], dp[pre][j] + a[i].v);
        }
        swap(pre, cur);
    }
    long long ans = 0;
    for(int i = 0; i <= S; i++) ans = max(ans, dp[pre][i]);
    cout << ans;
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    Solve();
}

• Subtask 1: 0 / 18
• Subtask 2: 0 / 18
• Subtask 3: 0 / 18
• Subtask 4: 0 / 18
• Subtask 5: 0 / 18
• Subtask 6: 0 / 10