Submission #1319054

#TimeUsernameProblemLanguageResultExecution timeMemory
1319054aaaaaaaaCloud Computing (CEOI18_clo)C++20
0 / 100
3095 ms444 KiB
#include <bits/stdc++.h> using namespace std; #define all(x) x.begin(), x.end() vector<vector<int>> v; long long f(int idx, int cores){ if(idx == (int) v.size()) return 0; long long not_take = f(idx + 1, cores), take = 0; if(v[idx][1] == 0){ take = (long long) f(idx + 1, cores + v[idx][2]) - v[idx][3]; }else{ if(v[idx][2] <= cores){ take = (long long) f(idx + 1, cores - v[idx][2]) + v[idx][3]; } } return max(take, not_take); } signed main(){ ios::sync_with_stdio(0); cin.tie(nullptr); cout.tie(nullptr); int n, m; cin >> n; for(int i = 0, a, b, c; i < n; ++i){ cin >> a >> b >> c; v.push_back({b, 0, a, c}); } cin >> m; for(int i = 0, a, b, c; i < m; ++i){ cin >> a >> b >> c; v.push_back({b, 1, a, c}); } sort(all(v), greater<>()); cout << f(0, 0) << "\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...