Submission #1273092

#TimeUsernameProblemLanguageResultExecution timeMemory
1273092algoproclubCloud Computing (CEOI18_clo)C++20
0 / 100
1 ms576 KiB
// UUID: 7ef87615-15b1-4bae-b411-68b82a2c58d9
#include <bits/stdc++.h>
using namespace std;

int main() {
#define int long long
	int n;
	cin >> n;
	vector<int> dppc(50*n+100, INT_MAX);
	dppc[0]=0;
	for(int i=0;i<n;i++){
		int c, _, v;
		cin >> c >> _ >> v;
		for(int j=50*i;0<=j;j--){
			dppc[j+c]=min(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=50*i;0<=j;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...