제출 #701799

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
701799		ifateen	Cloud Computing (CEOI18_clo)	C++14	0 / 100	3 ms	2644 KiB

clo

#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
using namespace std;
#define int long long
#define double long double
#define vec vector
#define vi vec<int>
#define pii pair<int,int>
#define vpi vec<pii>
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define pq priority_queue
#define all(v) v.begin(), v.end()
#define FOR(i,a,b) for (int i = a; i < b; i++)

struct Change {
    int core_change;
    int clock_needed;
    int money_change;
    Change(int core_change, int clock_needed, int money_change) {
        this->core_change = core_change;
        this->clock_needed = clock_needed;
        this->money_change = money_change;
    }
};

vec<Change> t;
vec<vi> dp;
int n, m;

int solve(int idx, int cores_left, bool chs = false) {
    if (idx >= n + m) return 0;
//    int &ret = dp[idx][cores_left];
if (!chs) {
    int &ret = dp[0][cores_left];
    if (ret != -1) return ret;
    Change ch = t[idx];
    if (cores_left + ch.core_change >= 0) {
        ret = max(ret, solve(idx + 1, cores_left + ch.core_change, true) + ch.money_change);
    }
    return ret = max(ret, solve(idx + 1, cores_left, true));
} else {
    int &ret = dp[1][cores_left];
    if (ret != -1) return ret;
    Change ch = t[idx];
    if (cores_left + ch.core_change >= 0) {
        ret = max(ret, solve(idx + 1, cores_left + ch.core_change, false) + ch.money_change);
    }
    return ret = max(ret, solve(idx + 1, cores_left, false));
}
}

signed main() {
    cin >> n;
    for (int i = 0; i < n; i++) {
        int core_count, clock_rate, price_needed;
        cin >> core_count >> clock_rate >> price_needed;
        t.emplace_back(core_count, clock_rate, -price_needed);
    }
    cin >> m;
    dp.resize(2, vi(100000, -1));
    for (int i = 0; i < m; i++) {
        int core_needed, clock_needed, price_gained;
        cin >> core_needed >> clock_needed >> price_gained;
        t.emplace_back(-core_needed, clock_needed, price_gained);
    }

    sort(all(t), [](Change a, Change b) {
       return a.clock_needed > b.clock_needed;
    });

//    for (auto i : t) {
//        cout << i.clock_needed << " " << i.core_change << " " << i.money_change << endl;
//    }

    cout << solve(0,0);
}

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