제출 #683600

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
683600		stevancv	Cloud Computing (CEOI18_clo)	C++14	100 / 100	752 ms	2132 KiB

clo

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 2e3 + 2;
const int M = 51 * N;
const ll linf = 9e18;
ll dp[2][M];
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    vector<array<int, 4>> all;
    int n; cin >> n;
    for (int i = 0; i < n; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        all.push_back({a, b, c, 0});
    }
    int m; cin >> m;
    for (int i = 0; i < m; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        all.push_back({a, b, c, 1});
    }
    sort(all.begin(), all.end(), [&] (array<int, 4> i, array<int, 4> j) {
        if (i[1] != j[1]) return i[1] > j[1];
        return i[3] < j[3];
    });
    for (int i = 0; i < 2; i++) for (int j = 0; j < M; j++) dp[i][j] = -linf;
    dp[0][0] = 0;
    int ii = 0;
    for (auto u : all) {
        ii ^= 1;
        for (int j = 0; j < M; j++) dp[ii][j] = dp[1 - ii][j];
        if (u[3] == 0) {
            for (int j = u[0]; j < M; j++) if (dp[1 - ii][j - u[0]] != -linf) smax(dp[ii][j], dp[1 - ii][j - u[0]] - u[2]);
        }
        else {
            for (int j = u[0]; j < M; j++) if (dp[1 - ii][j] != -linf) smax(dp[ii][j - u[0]], dp[1 - ii][j] + u[2]);
        }
    }
    ll ans = -linf;
    for (int j = 0; j < M; j++) smax(ans, dp[ii][j]);
    cout << ans << en;
    return 0;
}

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