Submission #1030732

#	Time	Username	Problem	Language	Result	Execution time	Memory
1030732		LmaoLmao	Cloud Computing (CEOI18_clo)	C++14	36 / 100	873 ms	1940 KiB

clo

#include<bits/stdc++.h>
using namespace std;

using ll = long long;
using ii = pair<int, int>;
using aa = array<ll,3>;

const int N = 1e6+5;
const int INF = 1e9;

aa a[10000];
ll dp[100005][2];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin >> n;
    int core=0;
    for(int i=0;i<n;i++) {
        cin >> a[i][2] >> a[i][0] >> a[i][1];
        a[i][1]*=-1;
        core+=a[i][2];
    }
    int m;
    cin >> m;
    for(int i=n;i<m+n;i++) {
        cin >> a[i][2] >> a[i][0] >> a[i][1];
        a[i][2]*=-1;
    }
    sort(a,a+n+m,greater<>());
    for(int i=1;i<=core;i++) dp[i][0]=-1e15;
    dp[0][1]=0;
    ll ans=-1e15;
    for(int i=0;i<n+m;i++) {
        for(int j=0;j<=core;j++) {
            dp[j][1]=dp[j][0];
        }
        for(int j=0;j<=core;j++) {
            if(j-a[i][2]>=0 && j-a[i][2]<=core) {
                if(dp[j-a[i][2]][0]!=-1e15)
                dp[j][1]=max(dp[j][1],dp[j-a[i][2]][0]+a[i][1]);
                ans=max(ans,dp[j][1]);
            }
            //cout << dp[j][1] << ' ';
        }
        //cout << endl;
        for(int j=0;j<=core;j++) {
            dp[j][0]=dp[j][1];
        }
    }
    cout << ans;
    return 0;
}

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