Submission #361764

#	Time	Username	Problem	Language	Result	Execution time	Memory
361764		ritul_kr_singh	Cloud Computing (CEOI18_clo)	C++14	100 / 100	1257 ms	3712 KiB

clo

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>
#define clock first
#define core second.first
#define price second.second

signed main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    int n, m; cin >> n;
    pair<int, pii> comps[4000]; // clock rate, {core, price}
    pair<int, pii> ii;
    int sum = 0, sum1 = 0;
    for(int j=0; j<n; ++j){
        cin >> ii.core >> ii.clock >> ii.price;
        ii.price = -ii.price;
        comps[j] = ii;
        sum += ii.core;
    }
    cin >> m;
    for(int j=0; j<m; ++j){
        cin >> ii.core >> ii.clock >> ii.price;
        sum1 += ii.core;
        ii.core = -ii.core;
        comps[n+j] = ii;
    }
    n += m;
    sort(comps, comps+n, greater<>());
    int lim=max(sum, sum1);
    int dp[2][lim+lim+1];
    int ind = 1;
    for(int i=0; i<2; ++i){
        for(int j=0; j<=lim; ++j){
            dp[i][j] = -1e18;
        }
        dp[i][lim] = 0;
        for(int j=1; j<=lim; ++j){
            dp[i][lim+j] = -1e18;
        }
    }
    int ans = -1e18;
    for(int x=1; x<=n; ++x){
        ind = 1-ind;
        int i = ind;
        auto curr = comps[x-1];
        for(int j=0; j<=lim+lim; ++j){
            dp[i][j] = dp[!i][j];
        }
        if(curr.core>=0){
            for(int j=lim+curr.core; j<=lim+lim; ++j){
                if(dp[!i][j-curr.core]>(int)-1e18)
                    dp[i][j] = max(dp[i][j], dp[!i][j-curr.core]+curr.price);
            }
        }else{
            curr.core = -curr.core;
            for(int j=lim+lim-curr.core; j+curr.core>=lim; --j){
                if(dp[!i][j+curr.core]>(int)-1e18)
                    dp[i][j] = max(dp[i][j], dp[!i][j+curr.core]+curr.price);
            }
        }
    }
    for(int j=0; j<=lim; ++j){
        ans = max(ans, dp[ind][j+lim]);
    }
    cout << ans << "\n";
}

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