Submission #1282832

#	Time	Username	Problem	Language	Result	Execution time	Memory
1282832		Jawad_Akbar_JJ	Cloud Computing (CEOI18_clo)	C++20	36 / 100	1497 ms	3752 KiB

clo

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
#define int long long
int dp[2][2005][102], inf = 1e17;

signed main(){
	int n, m;
	cin>>n;

	vector<pair<int, pair<int, int>>> buy = {{0, {0, 0}}}, sell = buy;

	for (int i=1, c, f, v;i<=n;i++){
		cin>>c>>f>>v;
		buy.push_back({f, {c, v}});
	}
	cin>>m;

	for (int i=1, c, f, v;i<=m;i++){
		cin>>c>>f>>v;
		sell.push_back({f, {c, v}});
	}

	sort(rbegin(buy), rend(buy));
	sort(rbegin(sell), rend(sell));

	for (int j=0;j<=n;j++){
		for (int k=0;k<=100;k++)
			dp[0][j][k] = dp[1][j][k] = -inf;
	}

	dp[0][0][0] = 0;

	for (int i=0;i<=n;i++){
		for (int j=0;j<=m;j++){
			for (int k=99;k>=0;k--)
				dp[0][j][k] = max(dp[0][j][k], dp[0][j][k+1]);
			for (int k=0;k<=100;k++){
				dp[1][j][k] = max(dp[1][j][k], dp[0][j][k]);
				dp[0][j+1][k] = max(dp[0][j+1][k], dp[0][j][k]);
				dp[1][j][min(100LL, k + buy[i].second.first)] = max(dp[1][j][min(100LL, k + buy[i].second.first)], dp[0][j][k] - buy[i].second.second);
				if (k - sell[j].second.first >= 0 and i > 0 and sell[j].first <= buy[i-1].first)
					dp[0][j+1][k - sell[j].second.first] = max(dp[0][j+1][k - sell[j].second.first], dp[0][j][k] + sell[j].second.second);
			}
		}
		for (int j=0;j<=m;j++)
			for (int k=0;k<=100;k++)
				dp[0][j][k] = dp[1][j][k], dp[1][j][k] = -inf;
	}
	cout<<dp[0][m][0]<<'\n';
}

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