제출 #400391

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
400391		abdzag	Cloud Computing (CEOI18_clo)	C++17	100 / 100	1306 ms	3640 KiB

clo

#include<bits/stdc++.h>
#include<unordered_map>
#define rep(i,a,b) for(int i=int(a);i<int(b);i++)
#define rrep(i,a,b) for(int i=int(a);i>int(b);i--)
#define all(v) v.begin(),v.end()
#define trav(a,v) for(auto&a:v)
#define  sz(a) a.size()
typedef long double ld;
using namespace std;
const long long inf = 1e15;
typedef long long ll;
typedef unsigned long long ull;

int main()
{
    cin.sync_with_stdio(false);
    ll n, m;
    cin >> n;
    vector<pair<pair<ll, ll>, pair<ll, ll>>> v(n);
    rep(i, 0, n) {
        cin >> v[i].second.first >> v[i].first.first >> v[i].second.second;
        v[i].first.first *= -1;
    }
    cin >> m;
    v.resize(n + m);
    rep(i, n, n + m) {
        cin >> v[i].second.first >> v[i].first.first >> v[i].second.second;
        v[i].first.first *= -1;
        v[i].first.second = 1;
    }
    sort(all(v));
    vector<ll>dp(2e5+1, -inf);
    dp[0] = 0;
    vector<ll> dp0 = dp;
    ll sumc = 1;
    rep(i, 0, n + m) {
        if (!v[i].first.second) {
            rep(j, 0, sumc) if (dp0[j] != -inf)dp[v[i].second.first + j] = max(dp0[v[i].second.first + j], dp0[j] - v[i].second.second);
        }
        else {
            rep(j, v[i].second.first, sumc)if (dp0[j] != -inf)dp[-v[i].second.first + j] = max(dp0[-v[i].second.first + j], dp0[j] + v[i].second.second);
        }
        sumc += v[i].second.first;
        dp0 = dp;
    }
    ll ans = 0;
    rep(i, 0, 2e5+1)ans = max(dp[i], ans);
    cout << ans;
    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