제출 #1143055

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1143055		DON_F	Cloud Computing (CEOI18_clo)	C++20	100 / 100	576 ms	2064 KiB

clo

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(x) x.begin(), x.end()
#define L(i, b, e) for (int i = b; i < e; ++i)
#define R(i, b, e) for (int i = b; i >= e; --i)
#define pb emplace_back
#define vi vector<int>
#define sz(x) ((int) x.size())
const int N = 2e3 + 7, Mx = 1e9 + 9;
int n, m;

struct info{
    int c, f, v, ty;
} a[2 * N];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n;
    L(i, 0, n){
        cin >> a[i].c >> a[i].f >> a[i].v;
        a[i].ty = 1;
    }
    cin >> m;
    L(i, n, n + m){
        cin >> a[i].c >> a[i].f >> a[i].v;
        a[i].ty = 2;
    }
    sort(a, a + n + m, [&](const info &cm, const info &cp){
         if (cm.f == cp.f){
            return cm.ty < cp.ty;
         }
         return cm.f > cp.f;
    });
    vector<ll> dp(50 * n + 7, -1LL * Mx * Mx);
    dp[0] = 0;
    L(i, 0, n + m){
        vector<ll> ndp(50 * n + 7, -1LL * Mx * Mx);
        L(j, 0, 50 * n + 1){
            if (dp[j] == -1LL * Mx * Mx)continue;
            if (a[i].ty == 1){
                ndp[j + a[i].c] = max(ndp[j + a[i].c], dp[j] - a[i].v);
            }else if (j >= a[i].c){
                ndp[j - a[i].c] = max(ndp[j - a[i].c], dp[j] + a[i].v);
            }
            ndp[j] = max(ndp[j], dp[j]);
        }
        swap(dp, ndp);
    }
    ll ans = 0;
    L(j, 0, 50 * n + 1)ans = max(ans, dp[j]);
    cout << ans;
}

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