제출 #867909

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
867909		VMaksimoski008	Cloud Computing (CEOI18_clo)	C++14	100 / 100	626 ms	2908 KiB

clo

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

struct T {
    int cores, rate, price;

    bool operator<(T &t) {
        if(rate == t.rate) return price < t.price;
        return rate > t.rate;
    }
};

int main() {
    int n;
    cin >> n;

    vector<T> v;
    v.push_back(T{0, 0, 0});
    ll total = 0;
    for(int i=0; i<n; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        total += a;
        v.push_back(T{a, b, -c});
    }

    int m;
    cin >> m;

    for(int i=0; i<m; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        v.push_back(T{-a, b, c});
    }

    sort(v.begin()+1, v.end());

    vector<vector<ll> > dp(2, vector<ll>(total+1, -1e18));
    dp[0][0] = 0;
    for(int i=1; i<=n+m; i++) {
        for(int j=0; j<=total; j++) {
            dp[1][j] = dp[0][j];
            if(j - v[i].cores >= 0 && j - v[i].cores <= total && dp[0][j-v[i].cores] != -1e18)
                dp[1][j] = max(dp[0][j], dp[0][j-v[i].cores] + v[i].price);
        }
        swap(dp[0], dp[1]);
    }

    ll ans = -1e18;
    for(int i=0; i<=total; i++) ans = max(ans, dp[0][i]);
    cout << ans << '\n';
    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