Submission #1272884

#TimeUsernameProblemLanguageResultExecution timeMemory
1272884zsomborCloud Computing (CEOI18_clo)C++20
100 / 100
274 ms2120 KiB
#include <iostream> #include <algorithm> #include <vector> using namespace std; using ll = long long; ll n, m, c, f, v, ans = 0; vector <vector <ll>> s; vector <ll> dp(2e5, -1e18); int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; for (int i = 0; i < n; i++) { cin >> c >> f >> v; s.push_back({ -f,-c,v }); } cin >> m; for (int i = 0; i < m; i++) { cin >> c >> f >> v; s.push_back({ -f,c,v }); } sort(s.begin(), s.end()); dp[0] = 0; for (auto& x : s) { c = abs(x[1]); v = x[2]; if (x[1] < 0) { for (int i = 1e5; i >= c; i--) dp[i] = max(dp[i], dp[i - c] - v); } else { for (int i = 0; i <= 1e5; i++) dp[i] = max(dp[i], dp[i + c] + v); } } for (ll x : dp) ans = max(ans, x); cout << ans; }
#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...