Submission #1192380

#	Time	Username	Problem	Language	Result	Execution time	Memory
1192380		Lithanium	Cloud Computing (CEOI18_clo)	C++20	100 / 100	237 ms	1352 KiB

clo

// buying a computer is + cores - profit
// selling a computer is - cores + profit

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

#define int long long

int dp[100005];

struct Node {
    int c, f, e, type;
};

int32_t main() {
    int N;
    cin >> N;
    vector<Node> nodes;
    for (int i = 1; i <= N; i ++) {
        int a, b, c;
        cin >> a >> b >> c;
        nodes.push_back({a, b, c, 0});
    }
    int M;
    cin >> M;
    for (int i = 1; i <= M; i ++) {
        int a, b, c;
        cin >> a >> b >> c;
        nodes.push_back({a, b, c, 1});
    }
    sort(nodes.begin(), nodes.end(), [](Node a, Node b) {
        if (a.f != b.f) return a.f > b.f;
        return a.type < b.type;
    });
    memset(dp, -0x3f, sizeof(dp));
    dp[0] = 0;
    for (Node curr:nodes) {
        if (curr.type == 0) {
            // buy some computers
            for (int i = 100000; i >= 0; i --) {
                dp[i + curr.c] = max(dp[i + curr.c], dp[i] - curr.e);
            }
        } else {
            // sell some computers
            for (int i = curr.c; i <= 100000; i ++) {
                dp[i - curr.c] = max(dp[i - curr.c], dp[i] + curr.e);
            }
        }
    }
    cout << *max_element(dp, dp+100005);
}

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