Submission #716128

#	Time	Username	Problem	Language	Result	Execution time	Memory
716128		penguin133	Cloud Computing (CEOI18_clo)	C++17	100 / 100	1104 ms	3712 KiB

clo

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

#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, m;
pii A[200005], B[200005];
/*
int memo[2001][501][101];

int dp(int x, int y, int rem){
	if(y == 0)return 0;
	if(memo[x][y][rem] != -1)return memo[x][y][rem];
	int res = dp(x, y-1, rem);
	if(rem >= B[y].se.fi)res = max(res, dp(x, y - 1, rem - B[y].se.fi) + B[y].se.se);
	if(x && A[x].fi >= B[y].fi){
		res = max(res, dp(x-1, y, rem));
		if(rem <= 50)res = max(res, dp(x - 1, y, rem + A[x].se.fi) - A[x].se.se);
	} 
	return memo[x][y][rem] = res;
}
*/
int dp[2][2005][105];
void solve(){
	cin >> n;
	//memset(memo, -1, sizeof(memo));
	for(int i=1;i<=n;i++)cin >> A[i].se.fi >> A[i].fi >> A[i].se.se;
	cin >> m;
	for(int i=1;i<=m;i++)cin >> B[i].se.fi >> B[i].fi >> B[i].se.se;
	sort(A+1, A+n+1);
	sort(B+1, B+m+1);
	//cout << dp(n, m, 0);
	//for(int i=1;i<=100;i++)dp[(n + 1)&1][m][i] = -1e18, dp[(n & 1)][m+1][i] = -1e18;
	/*
	for(int i=n;i>=1;i--){
		int x = i & 1;
		for(int j=m;j>=1;j--){
			for(int k=0;k<=100;k++){
				dp[x][j][k] = dp[x][j+1][k];
				if(k >= A[i].se.fi && A[i].fi >= B[j].fi)dp[x][j][k] = max(dp[x][j][k], dp[1-x][j][k - A[i].se.fi] - A[i].se.se);
				dp[x][j][k] = max(dp[x][j][k], dp[1-x][j][k]);
				if(k + B[j].se.fi <= 100)dp[x][j][k] = max(dp[x][j][k], dp[x][j+1][k + B[j].se.fi] + B[j].se.se);
			}
		}
	}
	*/
	for(int i=0;i<=n;i++){
		int x = i & 1;
		for(int j=1;j<=m;j++){
			for(int k=0;k<=100;k++){
				dp[x][j][k] = dp[x][j-1][k];
				if(i)dp[x][j][k] = max(dp[x][j][k], dp[1-x][j][k]);
				if(k >= B[j].se.fi)dp[x][j][k] = max(dp[x][j][k], dp[x][j-1][k-B[j].se.fi] + B[j].se.se);
				if(i && k + A[i].se.fi <= 100 && A[i].fi >= B[j].fi)dp[x][j][k] = max(dp[x][j][k], dp[1-x][j][k + A[i].se.fi] - A[i].se.se);
			}
		}
	}
	cout << dp[n%2][m][0];
}

main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	//cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

Compilation message (stderr)

clo.cpp:69:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   69 | main(){
      | ^~~~

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