제출 #656525

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
656525		MarcosPauloEvers	Cloud Computing (CEOI18_clo)	C++17	100 / 100	937 ms	2156 KiB

clo

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

struct Item { int f, c, v; };

const int MAXN = 2000, MAXC = 50;
int n, m;
int dp[2][MAXN * MAXC + 1];
vector<Item> item;

signed
main()
{
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	cin >> n;
	for (int i = 0, c, f, v; i < n; i++)
		cin >> c >> f >> v, item.push_back({f, c, -v});

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

	sort(begin(item), end(item), [](Item i, Item j){
		return make_tuple(-i.f, i.v, i.c) < make_tuple(-j.f, j.v, j.c);
	});
	
	memset(dp, 0xbf, sizeof(dp));
	dp[1][0] = dp[0][0] = 0;
	for (int i = 0; i < n + m; i++) {
		for (int j = 0; j <= MAXN * MAXC; j++)
			dp[i&1][j] = dp[(i&1)^1][j];

		for (int j = max(0ll, item[i].c);
			 j <= min(MAXN * MAXC, MAXN * MAXC + item[i].c); j++)
			dp[i&1][j] = max(dp[i&1][j], item[i].v + dp[(i&1)^1][j - item[i].c]);
	}

	int ans = 0;
	for (int i = 0; i <= MAXN * MAXC; i++)
		ans = max(ans, dp[((n + m)&1)^1][i]);

	cout << ans << "\n";
	return 0;
}

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