Submission #906215

#	Time	Username	Problem	Language	Result	Execution time	Memory
906215		Ludissey	Cloud Computing (CEOI18_clo)	C++14	36 / 100	3065 ms	262144 KiB

clo

#include <bits/stdc++.h>
using namespace std;
#define int long long

int n,m;
vector<pair<pair<int,int>,int>> table;
map<pair<int,int>,int> memo;

bool comp(pair<pair<int,int>,int> a, pair<pair<int,int>,int> b){
    if(a.first.second==b.first.second) return a.first.first>b.first.first;
    return a.first.second>b.first.second;
}

int dp(int x, int clck){
    if(memo.find({x,clck})!=memo.end()) return memo[{x,clck}];
    if(clck<0) return -1e10;
    if(x>=n+m) return 0;
    int mx=dp(x+1, clck);
    mx=max(dp(x+1, clck+table[x].first.first)+table[x].second,mx);
    return memo[{x,clck}]=mx;
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    cin >> n;
    table.resize(n);
    for (int i = 0; i < n; i++) { cin >> table[i].first.first >> table[i].first.second >> table[i].second; table[i].second=-table[i].second;}
    cin >> m;
    table.resize(n+m);
    for (int i = 0; i < m; i++) { cin >> table[i+n].first.first >> table[i+n].first.second >> table[i+n].second;  table[i+n].first.first=-table[i+n].first.first; }
    sort(table.begin(),table.end(),comp);
    cout << dp(0,0) << "\n";
    return 0;
}

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