제출 #943644

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
943644		iskhakkutbilim	Cloud Computing (CEOI18_clo)	C++17	100 / 100	607 ms	2296 KiB

clo

#include <bits/stdc++.h>

using namespace std;
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define int long long
const int N = 2e5;
const int mod = 1e16 + 7;
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int n; cin >> n;
    vector<array<int, 4> > w;
    for(int i = 0;i < n; i++){
        int c, f, cost; cin >> c >> f >> cost;
         w.push_back({c, f, cost, 1});
    }
    int m; cin >> m;
    for(int i = 0;i < m; i++){
        int c, f, cost; cin >> c >> f >> cost;
        w.push_back({c, f, cost, 0});
    }
    
    sort(all(w), [&](auto A, auto B){
        if(A[1] == B[1]) return A[3] > B[3];
        return A[1] > B[1];
    });
    vector<int> dp(N+5, -mod);
    dp[0] = 0;
    
    for(auto [c, f, cost, type] : w){
        if(type == 1){
            for(int i = N; i >= c; i--){
                dp[i] = max(dp[i], dp[i-c] - cost);
            }
        }else{
            for(int i = 0; i <= N - c; i++){
                dp[i] = max(dp[i], dp[i+c] + cost);
            }
        }
    }
    
    
    cout << *max_element(all(dp));
    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