제출 #917233

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
917233		ThommyDB	Cloud Computing (CEOI18_clo)	C++17	18 / 100	663 ms	2188 KiB

clo

#include<bits/stdc++.h>

using namespace std;
#define int long long

struct ComputersAndOrders{
    int cores;
    int clockSpeed;
    int price;
};

int n, m;
vector<ComputersAndOrders> computersAndOrders;

bool decreaseF(const ComputersAndOrders a, const ComputersAndOrders b){
    if(a.clockSpeed == b.clockSpeed){
        if(a.price==b.price){
            return a.price > b.price;
        }
        return a.cores > b.cores;
    }
    return a.clockSpeed > b.clockSpeed;
}

int DP(){
    vector<int> memo(1e5, -1e15);
    vector<int> mem;
    memo[0]=0;
    mem.assign(memo.begin(), memo.end());

    for(int i = 0; i < n+m; i++){
        for(int j = 0; j < 1e5; j++){
            if(memo[j] > -1e15 && j+computersAndOrders[i].cores>0){
                mem[j+computersAndOrders[i].cores] = max(memo[j+computersAndOrders[i].cores], memo[j]+computersAndOrders[i].price);
            }
        }

        memo.clear();
        memo.assign(mem.begin(), mem.end());
    }

    int ans = 0;
    for(int i = 0; i < 1e5; i++){
        ans = max(ans, memo[i]);
    }

    return ans;
}

signed main(){
    cin >> n;
    computersAndOrders.resize(n);
    int c, f, v;
    for(int i = 0; i <n; i++){
        cin >> c >> f >> v;
        computersAndOrders[i].cores = c;
        computersAndOrders[i].clockSpeed = f;
        computersAndOrders[i].price = -v;
    }
    cin >> m;
    computersAndOrders.resize(n+m);
    for(int i = 0; i < m; i++){
        cin >> c >> f >> v;
        computersAndOrders[i+n].cores = -c;
        computersAndOrders[i+n].clockSpeed = f;
        computersAndOrders[i+n].price = v;
    }
    sort(computersAndOrders.begin(), computersAndOrders.end(), decreaseF);

    cout << DP() << "\n";
}

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