Submission #1273091

#TimeUsernameProblemLanguageResultExecution timeMemory
1273091algoproclubCloud Computing (CEOI18_clo)C++20
0 / 100
1 ms572 KiB
// UUID: 541046c3-f659-41e6-83a9-dcd7ea53b1ab #include <bits/stdc++.h> using namespace std; int main() { #define int long long int n; cin >> n; vector<int> dppc(50*n+100, INT_MIN); dppc[0]=0; for(int i=0;i<n;i++){ int c, _, v; cin >> c >> _ >> v; for(int j=0;j<=50*i;j++){ dppc[j+c]=max(dppc[j+c], dppc[j]+v); } } int m; cin >> m; vector<int> dporder(50*m+100, INT_MIN); dporder[0]=0; for(int i=0;i<m;i++){ int c, _, v; cin >> c >> _ >> v; for(int j=0;j<=50*i;j++){ dporder[j+c]=max(dporder[j+c], dporder[j]+v); } } int ans=0; for(int i=0;i<50*n;i++){ ans=max(ans, dporder[i]-dppc[i]); } 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...