제출 #761706

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
761706		vgoofficial	Cloud Computing (CEOI18_clo)	C++14	100 / 100	398 ms	2008 KiB

clo

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct Order {
    ll numCores, clockRate, money;
    bool operator<(Order other) {
        if(other.clockRate>clockRate) {
            return false;
        }
        return true;
    }
};
int main() {
    ios_base::sync_with_stdio(false); 
    cin.tie(0);
    int n,m;
    cin >> n;
    vector<Order> shops;
    for(int i = 0; i < n; i++) {
        Order temp;
        cin >> temp.numCores >> temp.clockRate >> temp.money;
        shops.push_back(temp);
    }
    sort(shops.begin(), shops.end(),[](const Order &a, const Order &b) -> bool{
        return a.clockRate > b.clockRate;
    });
    vector<Order> customers;
    cin >> m;
    for(int i = 0; i < m; i++) {
        Order temp;
        cin >> temp.numCores >> temp.clockRate >> temp.money;
        customers.push_back(temp);
    }
    sort(customers.begin(), customers.end(),[](const Order &a, const Order &b) -> bool{
        return a.clockRate > b.clockRate;
    });
    ll maxProfit[50*(n+1)+1];
    for(int j = 0; j <= 50*(n+1); j++) {
        maxProfit[j]=-1e14;
    }
    int customerIndex = 0;
    while(shops[0].clockRate<customers[customerIndex].clockRate) customerIndex++;
    maxProfit[0]=0;
    for(int i = 1; i < n+1; i++) {
        ll tempMaxProfit[50*(n+1)+1];
        for(int j = 0; j <= 50*(n+1); j++) {
            tempMaxProfit[j]=-1e14;
        }
        for(int j = 0; j <= 50*(i-1); j++) {
            tempMaxProfit[j]=max(tempMaxProfit[j], maxProfit[j]); //dont buy from this shop
            tempMaxProfit[j+shops[i-1].numCores]=max(tempMaxProfit[j+shops[i-1].numCores], maxProfit[j]-shops[i-1].money); //buy from this shop
        }
        while(customerIndex<m) {
            if(i!=n) {
                if(customers[customerIndex].clockRate<=shops[i].clockRate) {
                    break;
                }
            }
            for(int j = customers[customerIndex].numCores; j <= 50*(n+1); j++) {
                tempMaxProfit[j-customers[customerIndex].numCores]=max(tempMaxProfit[j-customers[customerIndex].numCores], tempMaxProfit[j]+customers[customerIndex].money);
            }
            customerIndex++;
        }
        for(int j = 0; j <= 50 * (n+1); j++) {
            maxProfit[j]=tempMaxProfit[j];
        }
    }
    ll ans = 0;
    for(int i = 0; i <= 50 * (n+1); i++) {
        ans=max(ans, maxProfit[i]);
    }
    cout << ans << endl;
}
/*
3
4 2200 700
2 1800 10
4 2000 750
3
1 1500 300
6 1900 1500
3 2400 4550
*/

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