제출 #883569

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
883569		tsumondai	Cloud Computing (CEOI18_clo)	C++14	0 / 100	1 ms	1112 KiB

clo

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

#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)
#define __TIME  (1.0 * clock() / CLOCKS_PER_SEC)

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;

const int N = 2e3 + 5, CORE = 50;

const int oo = 1e9, mod = 1e9 + 7;

int n, m, dp[CORE * N];
vector<array<int, 4>> q;

void process() {
	cin >> n;
	foru(i, 1, n) {
		int c, f, v;
		cin >> c >> f >> v;
		q.pb({f, 1ll, c, -v});
	}
	cin >> m;
	foru(i, 1, m) {
		int C, F, V;
		cin >> C >> F >> V;
		q.pb({F, 0ll, C, V});
	}

	memset(dp, -0x3f, sizeof(dp));
	dp[0]=0;

	sort(q.rbegin(), q.rend());

	for (auto cmp : q) {
		if (cmp[1]) {
			ford(i, CORE, cmp[2]) {
				dp[i] = max(dp[i], dp[i - cmp[2]] + cmp[3]);
			}
		} else {
			foru(i, 0, CORE) {
				dp[i] = max(dp[i], dp[i + cmp[2]] + cmp[3]);
			}
		}
	}

	int ans=*max_element(dp, dp+CORE+1);

	cout << ans << '\n';

	return;
}

signed main() {
	cin.tie(0)->sync_with_stdio(false);
	//freopen(".inp", "r", stdin);
	//freopen(".out", "w", stdout);
	process();
	cerr << "Time elapsed: " << __TIME << " s.\n";
	return 0;
}

// dont stop

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