제출 #858756

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
858756		boyliguanhan	Cloud Computing (CEOI18_clo)	C++17	54 / 100	38 ms	812 KiB

clo

/******************************************************************************

Welcome to GDB Online.
  GDB online is an online compiler and debugger tool for C, C++, Python, PHP, Ruby, 
  C#, OCaml, VB, Perl, Swift, Prolog, Javascript, Pascal, COBOL, HTML, CSS, JS
  Code, Compile, Run and Debug online from anywhere in world.

*******************************************************************************/
#include <bits/stdc++.h>
using namespace std;
#define MX 10001
vector<tuple<int, int, int>> v;
long long dp[MX];
int main() {
    memset(dp,-8,sizeof dp);
    dp[0]=0;
    int n, m;
    cin >> n;
    while(n--) {
        int a, b, c;
        cin >> a >> b >> c;
        v.push_back({b,a,-c});
    }
    cin >> m;
    while(m--) {
        int a, b, c;
        cin >> a >> b >> c;
        v.push_back({b,-a,c});
    }
    sort(v.begin(),v.end());
    reverse(v.begin(),v.end());
    for(auto K: v) {
        int a, b, c;
        tie(a,b,c)=K;
        if(b > 0) {
            for(int i = MX; i-- > b;)
                dp[i]=max(dp[i],c+dp[i-b]);
        } else {
            for(int i = 0; i < MX+b; i++)
                dp[i]=max(dp[i],c+dp[i-b]);
        }
    }
    cout << *max_element(dp,dp+MX);
    return 0;
}

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