제출 #682097

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
682097		sz1218	Cloud Computing (CEOI18_clo)	C++14	100 / 100	840 ms	2012 KiB

clo

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef pair<pi, ll> pl;

#define f first
#define s second

const int NN = 1e5+3;
int n, m;
ll dp[2][NN];

struct S{
    int c;
    int f;
    ll v;
    bool operator<(const S& y){
        if(f == y.f)return c > y.c;
        return f > y.f;
    }
};

S trans[4003];

int main()
{
    //setIO("");
    cin >> n;
    ll v;
    for(int i=1, c, f;i<=n;i++){
        cin >> c >> f >> v;
        trans[i] = S{c, f, -v};
    }
    cin >> m;
    for(int i=1, c, f;i<=m;i++){
        cin >> c >> f >> v;
        trans[n+i] = S{-c, f, v};
    }
    sort(trans+1, trans + n + m + 1);

    for(int i=1;i<=50*m;i++){
        dp[0][i] = dp[1][i] = -1e18;
    }

    for(int t=1;t<=n+m;t++){
        int p = t % 2;
        for(int i=0;i<=50*m;i++){
            dp[p][i] = dp[1-p][i];
            int ni = i - trans[t].c;
            if(ni >= 0 && ni <= 50*m && dp[1-p][ni] != -1e18){
                dp[p][i] = max(dp[p][i], dp[1-p][ni] + trans[t].v);
            }
        }
    }
    ll ans = 0;
    for(int i=0;i<=50*m;i++){
        ans = max(ans, dp[(n+m)%2][i]);
    }
    cout << ans << endl;

    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