oj.uz

Submission #678378

# Submission time Handle Problem Language Result Execution time Memory
678378 2023-01-05T17:22:20 Z 42kangaroo Cloud Computing (CEOI18_clo) C++17
100 / 100
 422 ms 1364 KB 
//
// Created by 42kangaroo on 05/01/2023.
//
#include "bits/stdc++.h"

using namespace std;

#define int long long

struct Comp {
	int c, r, p;
	bool order;
};

bool operator<(const Comp& l, const Comp& r) {
	return tie(r.r, l.order) < tie(l.r, r.order);
}

signed main() {
	int n;
	cin >> n;
	vector<Comp> cp(n);
	int s = 0;
	for (auto& c:cp) {
		cin>> c.c >> c.r >> c.p;
		s += c.c;
		c.order = false;
	}
	int m;
	cin >> m;
	cp.resize(n + m);
	for (int i = n; i < n + m; ++i) {
		cin >> cp[i].c >> cp[i].r >> cp[i].p;
		cp[i].order = true;
	}
	std::sort(cp.begin(), cp.end());
	vector<int> dp(s + 1, numeric_limits<int>::min());
	dp[0] = 0;
	for (auto& o: cp) {
		if (o.order) {
			for (int i = 0; i <= s - o.c; ++i) {
				if (dp[i+o.c] != numeric_limits<int>::min()) {
					dp[i] = max(dp[i], dp[i + o.c] + o.p);
				}
			}
		} else {
			for (int i = s; i >= o.c; --i) {
				if (dp[i - o.c] != numeric_limits<int>::min()) {
					dp[i] = max(dp[i], dp[i - o.c] - o.p);
				}
			}
		}
	}
	int ma = numeric_limits<int>::min();
	for (int i = 0; i <= s; ++i) {
		ma = max(ma, dp[i]);
	}
	cout << ma << "\n";
}/*
4
4 2200 700
2 1800 10
20 2550 9999
4 2000 750
3
1 1500 300
6 1900 1500
3 2400 4550*/

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 3 ms 392 KB Output is correct
6 Correct 2 ms 312 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 4 ms 404 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 26 ms 564 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 103 ms 852 KB Output is correct
8 Correct 19 ms 468 KB Output is correct
9 Correct 167 ms 1108 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 232 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 316 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 9 ms 340 KB Output is correct
4 Correct 3 ms 312 KB Output is correct
5 Correct 265 ms 824 KB Output is correct
6 Correct 422 ms 1236 KB Output is correct
7 Correct 412 ms 1236 KB Output is correct
8 Correct 400 ms 1108 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 21 ms 468 KB Output is correct
4 Correct 6 ms 404 KB Output is correct
5 Correct 392 ms 1236 KB Output is correct
6 Correct 403 ms 1108 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 3 ms 392 KB Output is correct
6 Correct 2 ms 312 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 4 ms 404 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 26 ms 564 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 103 ms 852 KB Output is correct
16 Correct 19 ms 468 KB Output is correct
17 Correct 167 ms 1108 KB Output is correct
18 Correct 1 ms 300 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 232 KB Output is correct
21 Correct 1 ms 304 KB Output is correct
22 Correct 1 ms 308 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 316 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 300 KB Output is correct
28 Correct 9 ms 340 KB Output is correct
29 Correct 3 ms 312 KB Output is correct
30 Correct 265 ms 824 KB Output is correct
31 Correct 422 ms 1236 KB Output is correct
32 Correct 412 ms 1236 KB Output is correct
33 Correct 400 ms 1108 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 21 ms 468 KB Output is correct
37 Correct 6 ms 404 KB Output is correct
38 Correct 392 ms 1236 KB Output is correct
39 Correct 403 ms 1108 KB Output is correct
40 Correct 28 ms 468 KB Output is correct
41 Correct 67 ms 596 KB Output is correct
42 Correct 9 ms 468 KB Output is correct
43 Correct 362 ms 1212 KB Output is correct
44 Correct 389 ms 1332 KB Output is correct
45 Correct 369 ms 1364 KB Output is correct
46 Correct 4 ms 340 KB Output is correct
47 Correct 8 ms 480 KB Output is correct
48 Correct 8 ms 384 KB Output is correct