제출 #821854

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
821854		NK_	Cloud Computing (CEOI18_clo)	C++17	100 / 100	379 ms	1272 KiB

clo

// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>

using namespace std;

#define nl '\n'
#define pb push_back

using ll = long long;

template<class T> using V = vector<T>;
using vi = V<int>;
using vl = V<ll>;

int main() {
	cin.tie(0)->sync_with_stdio(0);
	
	int N; cin >> N;
	V<array<int, 3>> A;
	V<array<int, 2>> CS, CB;

	for(int i = 0; i < N; i++) {
		int c, f, v; cin >> c >> f >> v;
		A.pb({f, 1, i});
		CB.pb({c, v});
	}

	int M; cin >> M;
	for(int i = 0; i < M; i++) {
		int c, f, v; cin >> c >> f >> v;
		A.pb({f, -1, i});
		CS.pb({c, v});
	}

	sort(begin(A), end(A));

	const int nax = N * 50 + 5;

	ll dp[nax]; memset(dp, -1, sizeof dp);
	dp[0] = 0;
	for(int i = 0; i < N + M; i++) {
		V<array<int, 2>> S, B; 

		int j = i;
		while(j < N + M && A[j][0] == A[i][0]) {
			if (A[j][1] == -1) S.pb(CS[A[j][2]]);
			else B.pb(CB[A[j][2]]);
			j++;
		}
		i = j - 1;

		for(const auto &s : S) {
			int c = s[0], v = s[1];

			for(int x = nax - 1; x >= 0; x--) if (dp[x] != -1) {
				int y = x + c;
				if (y < nax) dp[y] = max(dp[x] + v, dp[y]);
			}
		}

		for(const auto &s : B) {
			int c = s[0], v = s[1];

			for(int x = 0; x < nax; x++) if (dp[x] != -1) {
				int y = max(x - int(c), 0);
				dp[y] = max(dp[x] - v, dp[y]);
			}
		}
	}

	cout << dp[0] << nl;

    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