제출 #1257175

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1257175		inkvizytor	Cloud Computing (CEOI18_clo)	C++20	90 / 100	257 ms	1352 KiB

clo

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

#define ll long long

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    vector<pair<ll, pair<ll, ll>>> a;
    for (int i = 0; i < n; i++) {
        ll c, f, v;
        cin >> c >> f >> v;
        a.push_back({f, {c, -v}});
    }
    int m;
    cin >> m;
    for (int i = 0; i < m; i++) {
        ll c, f, v;
        cin >> c >> f >> v;
        a.push_back({f, {-c, v}});
    }
    sort(a.begin(), a.end(), greater<pair<ll, pair<ll ,ll>>>());
    vector<ll> dp ((1e5)+100, -(ll)1e18);
    dp[0] = 0;
    for (auto x : a) {
        if (x.second.first > 0) {
            for (int i = (1e5)-1; i >= 0; i--) {
                if ((dp[i] != -(ll)1e18) && i+x.second.first >= 0) {
                    dp[i+x.second.first] = max(dp[i+x.second.first], dp[i]+x.second.second);
                }
            }
        }
        else {
            for (int i = 0; i <1e5; i++) {
                if ((dp[i] != -(ll)1e18) && i+x.second.first >= 0) {
                    dp[i+x.second.first] = max(dp[i+x.second.first], dp[i]+x.second.second);
                }
            }

        }
    }
    ll w = 0;
    for (ll i : dp) {
        w = max(w, i);
    }
    cout << w << '\n';
}

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