Submission #848679

#	Time	Username	Problem	Language	Result	Execution time	Memory
848679		quanlt206	Cloud Computing (CEOI18_clo)	C++14	36 / 100	291 ms	262144 KiB

clo

#include<bits/stdc++.h>
#define X first
#define Y second
#define all(x) begin(x), end(x)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define FORD(i, b, a) for(int i = (b); i >= (a); i--)
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define mxx max_element
#define mnn min_element
#define SQR(x) (1LL * (x) * (x))
#define MASK(i) (1LL << (i))
#define Point Vector
#define left Left
#define right Right
#define div Div

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair<db, db> pdb;
typedef pair<ld, ld> pld;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plll;
typedef pair<ll, int> pli;
typedef pair<ll, pii> plii;

template<class A, class B>
    bool maximize(A& x, B y) {
        if (x < y) return x = y, true; else return false;
    }
template<class A, class B>
    bool minimize(A& x, B y) {
        if (x > y) return x = y, true; else return false;
    }
/* END OF TEMPLATE */

const int N = 4007;

struct cloud {
    int c, f, v;
    bool isMc;
    cloud() {
        c = f = v = 0;
        isMc = false;
    }
} a[N], b[N];

int n, m;

ll dp[N][10007];


int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin>>n;
    FOR(i, 1, n) {
        cin>>a[i].c>>a[i].f>>a[i].v;
        a[i].isMc = true;
    }
    cin>>m;
    FOR(i, 1, m) cin>>a[i + n].c>>a[i + n].f>>a[i + n].v;
    n+=m;
    sort(a + 1, a + 1 + n, [](cloud& a, cloud& b) {
         return (a.f != b.f ? a.f > b.f : a.isMc);
    });
    FOR(i, 0, n)
        FOR(j, 0, 10000) dp[i][j] = -1e18;
    dp[0][0] = 0;
//    FOR(i, 1, n) cout<<a[i].c<<" "<<a[i].f<<" "<<a[i].v<<"\n";
    REP(i, 0, n)
        FOR(j, 0, 10000)
            if (dp[i][j] != -1e18) {
                maximize(dp[i + 1][j], dp[i][j]);
//                cout<<i<<" "<<j<<" "<<dp[i][j]<<"\n";
                if (a[i + 1].isMc) {
                    maximize(dp[i + 1][min(j + a[i + 1].c, 10000)], dp[i][j] - a[i + 1].v);
                }
                else {
                    if (j >= a[i + 1].c)
                        maximize(dp[i + 1][j - a[i + 1].c], dp[i][j] + a[i + 1].v);
                }
            }
    ll res = 0;
    FOR(j, 0, 10000) maximize(res, dp[n][j]);
    cout<<res;
    return 0;
}

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