oj.uz

Submission #934424

# Submission time Handle Problem Language Result Execution time Memory
934424 2024-02-27T10:08:22 Z garamlee500 Cloud Computing (CEOI18_clo) C++17
100 / 100
 312 ms 1620 KB 
#include <iostream>
#include <algorithm>


using namespace std;

struct item {
	int cores;
	int clock;
	long long money;
	bool isComputer;
	item(int cores, int clock, long long money, bool isComputer) :
		cores(cores),
		clock(clock),
		money(money),
		isComputer(isComputer)	
	{

	}

	item() = default;
};

item items[4000];
long long dp[100001];


int n, m, c, f, nm;
long long v;
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> c >> f >> v;
		items[i] = item(c, f, v, true);
	}
	cin >> m;
	nm = n + m;
	for (int i = n; i < nm; i++) {
		cin >> c >> f >> v;
		items[i] = item(c, f, v, false);
	}
	// put to left those with larger clock speeds,
	// prefering computers first.
	sort(begin(items), begin(items) + nm,

		[](item& a, item& b) {
			if (a.clock == b.clock) {
				return a.isComputer&&!b.isComputer;
			}

			return a.clock > b.clock;
		});

	for (int i = 1; i <= 100000; i++) {
		dp[i] = -10000000000000000;
	}
	dp[0] = 0;
	for (int i = 0; i < nm; i++) {
		item item1 = items[i];
		if (item1.isComputer) {
			for (int newCoreCount = 100000; newCoreCount >= item1.cores; newCoreCount--) {
				dp[newCoreCount] = max(dp[newCoreCount], dp[newCoreCount - item1.cores] - item1.money);
			}
		}
		else {
			for (int newCoreCount = 0; newCoreCount + item1.cores <= 100000; newCoreCount++) {
				dp[newCoreCount] = max(dp[newCoreCount], dp[newCoreCount + item1.cores] + item1.money);
			}
		}
	}
	long long best = 0;
	for (int i = 0; i <= 100000; i++) {
		best = max(best, dp[i]);
	}
	cout << best << '\n';

}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 9 ms 1116 KB Output is correct
4 Correct 17 ms 1248 KB Output is correct
5 Correct 142 ms 1264 KB Output is correct
6 Correct 140 ms 1112 KB Output is correct
7 Correct 149 ms 1116 KB Output is correct
8 Correct 150 ms 1268 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 9 ms 1116 KB Output is correct
4 Correct 9 ms 1116 KB Output is correct
5 Correct 78 ms 1248 KB Output is correct
6 Correct 72 ms 1116 KB Output is correct
7 Correct 156 ms 1112 KB Output is correct
8 Correct 156 ms 1360 KB Output is correct
9 Correct 153 ms 1112 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1116 KB Output is correct
2 Correct 3 ms 1240 KB Output is correct
3 Correct 15 ms 1116 KB Output is correct
4 Correct 16 ms 1112 KB Output is correct
5 Correct 33 ms 1116 KB Output is correct
6 Correct 31 ms 1240 KB Output is correct
7 Correct 39 ms 1116 KB Output is correct
8 Correct 39 ms 1116 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1312 KB Output is correct
2 Correct 2 ms 1116 KB Output is correct
3 Correct 116 ms 1260 KB Output is correct
4 Correct 141 ms 1280 KB Output is correct
5 Correct 287 ms 1372 KB Output is correct
6 Correct 303 ms 1372 KB Output is correct
7 Correct 312 ms 1368 KB Output is correct
8 Correct 292 ms 1372 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 13 ms 1240 KB Output is correct
3 Correct 68 ms 1116 KB Output is correct
4 Correct 156 ms 1368 KB Output is correct
5 Correct 304 ms 1112 KB Output is correct
6 Correct 309 ms 1364 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 9 ms 1116 KB Output is correct
4 Correct 17 ms 1248 KB Output is correct
5 Correct 142 ms 1264 KB Output is correct
6 Correct 140 ms 1112 KB Output is correct
7 Correct 149 ms 1116 KB Output is correct
8 Correct 150 ms 1268 KB Output is correct
9 Correct 2 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 9 ms 1116 KB Output is correct
12 Correct 9 ms 1116 KB Output is correct
13 Correct 78 ms 1248 KB Output is correct
14 Correct 72 ms 1116 KB Output is correct
15 Correct 156 ms 1112 KB Output is correct
16 Correct 156 ms 1360 KB Output is correct
17 Correct 153 ms 1112 KB Output is correct
18 Correct 3 ms 1116 KB Output is correct
19 Correct 3 ms 1240 KB Output is correct
20 Correct 15 ms 1116 KB Output is correct
21 Correct 16 ms 1112 KB Output is correct
22 Correct 33 ms 1116 KB Output is correct
23 Correct 31 ms 1240 KB Output is correct
24 Correct 39 ms 1116 KB Output is correct
25 Correct 39 ms 1116 KB Output is correct
26 Correct 2 ms 1312 KB Output is correct
27 Correct 2 ms 1116 KB Output is correct
28 Correct 116 ms 1260 KB Output is correct
29 Correct 141 ms 1280 KB Output is correct
30 Correct 287 ms 1372 KB Output is correct
31 Correct 303 ms 1372 KB Output is correct
32 Correct 312 ms 1368 KB Output is correct
33 Correct 292 ms 1372 KB Output is correct
34 Correct 1 ms 1112 KB Output is correct
35 Correct 13 ms 1240 KB Output is correct
36 Correct 68 ms 1116 KB Output is correct
37 Correct 156 ms 1368 KB Output is correct
38 Correct 304 ms 1112 KB Output is correct
39 Correct 309 ms 1364 KB Output is correct
40 Correct 78 ms 1256 KB Output is correct
41 Correct 145 ms 1112 KB Output is correct
42 Correct 232 ms 1364 KB Output is correct
43 Correct 304 ms 1372 KB Output is correct
44 Correct 309 ms 1620 KB Output is correct
45 Correct 303 ms 1368 KB Output is correct
46 Correct 151 ms 1116 KB Output is correct
47 Correct 237 ms 1332 KB Output is correct
48 Correct 225 ms 1112 KB Output is correct