oj.uz

답안 #826626

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
826626 2023-08-15T18:15:29 Z georgievskiy Cloud Computing (CEOI18_clo) C++17
100 / 100
 965 ms 3612 KB 
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;

#define max_(a, b) a = max((a), (b))
#define ll long long

const int N = 2004, K = 101;
const ll inf = 1e15;
ll dp[2][N][K];

int main() {
	ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	int n;
	cin >> n;
	struct st {
		int c, f, v;
		bool operator<(st ot) {
			return f < ot.f;
		}
	};
	vector<st> a(n);
	for (int i = 0; i < n; i++)
		cin >> a[i].c >> a[i].f >> a[i].v;
	int m;
	cin >> m;
	vector<st> q(m);
	for (int i = 0; i < m; i++)
		cin >> q[i].c >> q[i].f >> q[i].v;
	sort(a.rbegin(), a.rend()), sort(q.rbegin(), q.rend());
	for (int i = 0; i < 2; i++)
		for (int j = 0; j <= m; j++)
			for (int k = 0; k < K; k++) dp[i][j][k] = -inf;

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

	ll ans = 0;
	for (int i = 1; i <= n; i++) {
		int i2 = i & 1;
		auto& comp = a[i - 1];

		// j == 0
		for (int k = 0; k < K; k++) {
			auto& v = dp[i2][0][k];
			max_(v, dp[1 - i2][0][k]);
			if (k - comp.c >= 0)
				max_(v, dp[1 - i2][0][k - comp.c] - comp.v);
		}

		for (int j = 1; j <= m; j++) {
			auto& cust = q[j - 1];

			for (int k = comp.c; k < K; k++) {
				auto& v = dp[i2][j][k];
				max_(v, dp[1 - i2][j][k - comp.c] - comp.v);
			}
			if (comp.f >= cust.f) {
				for (int k = 0; k < K - cust.c; k++) {
					auto& v = dp[i2][j][k];
					max_(v, dp[i2][j - 1][k + cust.c] + cust.v);
				}
			}

			for (int k = 0; k < K; k++) {
				auto& v = dp[i2][j][k];
				max_(v, max(dp[1 - i2][j][k], dp[i2][j - 1][k]));
				// if (k - comp.c >= 0)
				// 	max_(v, dp[1 - i2][j][k - comp.c] - comp.v);
				// if (k + cust.c < K && comp.f >= cust.f)
				// 	max_(v, dp[i2][j - 1][k + cust.c] + cust.v);
				max_(ans, v);
			}
			// for (int k = 0; k < K; k++)
			// 	cout << i << " " << j << " " << k << " " << dp[i2][j][k] << "\n";
		}
	}
	cout << ans << "\n";

	return 0;
}

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 8 ms 3288 KB Output is correct
6 Correct 10 ms 3284 KB Output is correct
7 Correct 8 ms 3540 KB Output is correct
8 Correct 8 ms 3540 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 324 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 4 ms 388 KB Output is correct
7 Correct 10 ms 428 KB Output is correct
8 Correct 11 ms 340 KB Output is correct
9 Correct 7 ms 340 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 10 ms 468 KB Output is correct
6 Correct 11 ms 572 KB Output is correct
7 Correct 17 ms 724 KB Output is correct
8 Correct 17 ms 740 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 320 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 4 ms 340 KB Output is correct
4 Correct 8 ms 3224 KB Output is correct
5 Correct 965 ms 3228 KB Output is correct
6 Correct 869 ms 3564 KB Output is correct
7 Correct 930 ms 3584 KB Output is correct
8 Correct 866 ms 3584 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 29 ms 736 KB Output is correct
4 Correct 302 ms 2260 KB Output is correct
5 Correct 781 ms 3580 KB Output is correct
6 Correct 936 ms 3548 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 8 ms 3288 KB Output is correct
6 Correct 10 ms 3284 KB Output is correct
7 Correct 8 ms 3540 KB Output is correct
8 Correct 8 ms 3540 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 324 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 4 ms 388 KB Output is correct
15 Correct 10 ms 428 KB Output is correct
16 Correct 11 ms 340 KB Output is correct
17 Correct 7 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 328 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 10 ms 468 KB Output is correct
23 Correct 11 ms 572 KB Output is correct
24 Correct 17 ms 724 KB Output is correct
25 Correct 17 ms 740 KB Output is correct
26 Correct 0 ms 320 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 4 ms 340 KB Output is correct
29 Correct 8 ms 3224 KB Output is correct
30 Correct 965 ms 3228 KB Output is correct
31 Correct 869 ms 3564 KB Output is correct
32 Correct 930 ms 3584 KB Output is correct
33 Correct 866 ms 3584 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1 ms 460 KB Output is correct
36 Correct 29 ms 736 KB Output is correct
37 Correct 302 ms 2260 KB Output is correct
38 Correct 781 ms 3580 KB Output is correct
39 Correct 936 ms 3548 KB Output is correct
40 Correct 60 ms 1160 KB Output is correct
41 Correct 186 ms 2220 KB Output is correct
42 Correct 620 ms 2752 KB Output is correct
43 Correct 858 ms 3576 KB Output is correct
44 Correct 847 ms 3592 KB Output is correct
45 Correct 750 ms 3612 KB Output is correct
46 Correct 266 ms 1876 KB Output is correct
47 Correct 590 ms 2772 KB Output is correct
48 Correct 562 ms 2644 KB Output is correct