oj.uz

Submission #145052

# Submission time Handle Problem Language Result Execution time Memory
145052 2019-08-18T15:15:46 Z faremy Cloud Computing (CEOI18_clo) C++14
100 / 100
 415 ms 1372 KB 
#include <iostream>
#include <algorithm>


struct Computer
{
	int cores, freq;
	long long price;
	
	bool operator <(const Computer &other) const
	{
		if (freq != other.freq)
			return (other.freq < freq);
		return (other.cores < cores);
	}
};

const int MAXN = 4e3;
const int MAXC = 1e5 + 1;
const long long NOPE = -1e18;

Computer choice[MAXN];
long long benef[MAXC];


int main()
{
	std::ios::sync_with_stdio(false);
	std::cout.tie(nullptr);
	std::cin.tie(nullptr);

	int computers; std::cin >> computers;
	for (int iComp = 0; iComp < computers; iComp++)
		std::cin >> choice[iComp].cores >> choice[iComp].freq >> choice[iComp].price;

	int orders; std::cin >> orders;
	for (int iOrd = computers; iOrd < computers + orders; iOrd++)
	{
		std::cin >> choice[iOrd].cores >> choice[iOrd].freq >> choice[iOrd].price;
		choice[iOrd].cores *= -1;
	}

	std::sort(choice, choice + computers + orders);
	std::fill_n(benef, MAXC, NOPE);
	benef[0] = 0;

	for (int iChoice = 0; iChoice < computers + orders; iChoice++)
	{
		if (choice[iChoice].cores > 0)
			for (int iCore = MAXC - 1 - choice[iChoice].cores; iCore > -1; iCore--)
				benef[iCore + choice[iChoice].cores] = std::max(benef[iCore + choice[iChoice].cores], benef[iCore] - choice[iChoice].price);
		else
			for (int iCore = -choice[iChoice].cores; iCore < MAXC; iCore++)
				benef[iCore + choice[iChoice].cores] = std::max(benef[iCore + choice[iChoice].cores], benef[iCore] + choice[iChoice].price);
	}

	long long maxBenef = 0;
	for (int iCore = 0; iCore < MAXC; iCore++)
		maxBenef = std::max(maxBenef, benef[iCore]);
	std::cout << maxBenef << '\n';

	return 0;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1144 KB Output is correct
2 Correct 3 ms 1144 KB Output is correct
3 Correct 14 ms 1144 KB Output is correct
4 Correct 25 ms 1144 KB Output is correct
5 Correct 202 ms 1144 KB Output is correct
6 Correct 202 ms 1272 KB Output is correct
7 Correct 213 ms 1372 KB Output is correct
8 Correct 213 ms 1144 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1144 KB Output is correct
2 Correct 4 ms 1144 KB Output is correct
3 Correct 14 ms 1144 KB Output is correct
4 Correct 14 ms 1144 KB Output is correct
5 Correct 96 ms 1204 KB Output is correct
6 Correct 98 ms 1148 KB Output is correct
7 Correct 201 ms 1148 KB Output is correct
8 Correct 202 ms 1144 KB Output is correct
9 Correct 204 ms 1272 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1144 KB Output is correct
2 Correct 6 ms 1152 KB Output is correct
3 Correct 21 ms 1144 KB Output is correct
4 Correct 21 ms 1144 KB Output is correct
5 Correct 40 ms 1144 KB Output is correct
6 Correct 39 ms 1144 KB Output is correct
7 Correct 54 ms 1144 KB Output is correct
8 Correct 54 ms 1144 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1144 KB Output is correct
2 Correct 4 ms 1144 KB Output is correct
3 Correct 152 ms 1204 KB Output is correct
4 Correct 192 ms 1272 KB Output is correct
5 Correct 383 ms 1288 KB Output is correct
6 Correct 409 ms 1272 KB Output is correct
7 Correct 405 ms 1272 KB Output is correct
8 Correct 403 ms 1272 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1144 KB Output is correct
2 Correct 19 ms 1052 KB Output is correct
3 Correct 84 ms 1224 KB Output is correct
4 Correct 206 ms 1220 KB Output is correct
5 Correct 403 ms 1372 KB Output is correct
6 Correct 406 ms 1272 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1144 KB Output is correct
2 Correct 3 ms 1144 KB Output is correct
3 Correct 14 ms 1144 KB Output is correct
4 Correct 25 ms 1144 KB Output is correct
5 Correct 202 ms 1144 KB Output is correct
6 Correct 202 ms 1272 KB Output is correct
7 Correct 213 ms 1372 KB Output is correct
8 Correct 213 ms 1144 KB Output is correct
9 Correct 3 ms 1144 KB Output is correct
10 Correct 4 ms 1144 KB Output is correct
11 Correct 14 ms 1144 KB Output is correct
12 Correct 14 ms 1144 KB Output is correct
13 Correct 96 ms 1204 KB Output is correct
14 Correct 98 ms 1148 KB Output is correct
15 Correct 201 ms 1148 KB Output is correct
16 Correct 202 ms 1144 KB Output is correct
17 Correct 204 ms 1272 KB Output is correct
18 Correct 7 ms 1144 KB Output is correct
19 Correct 6 ms 1152 KB Output is correct
20 Correct 21 ms 1144 KB Output is correct
21 Correct 21 ms 1144 KB Output is correct
22 Correct 40 ms 1144 KB Output is correct
23 Correct 39 ms 1144 KB Output is correct
24 Correct 54 ms 1144 KB Output is correct
25 Correct 54 ms 1144 KB Output is correct
26 Correct 5 ms 1144 KB Output is correct
27 Correct 4 ms 1144 KB Output is correct
28 Correct 152 ms 1204 KB Output is correct
29 Correct 192 ms 1272 KB Output is correct
30 Correct 383 ms 1288 KB Output is correct
31 Correct 409 ms 1272 KB Output is correct
32 Correct 405 ms 1272 KB Output is correct
33 Correct 403 ms 1272 KB Output is correct
34 Correct 3 ms 1144 KB Output is correct
35 Correct 19 ms 1052 KB Output is correct
36 Correct 84 ms 1224 KB Output is correct
37 Correct 206 ms 1220 KB Output is correct
38 Correct 403 ms 1372 KB Output is correct
39 Correct 406 ms 1272 KB Output is correct
40 Correct 106 ms 1240 KB Output is correct
41 Correct 208 ms 1224 KB Output is correct
42 Correct 307 ms 1244 KB Output is correct
43 Correct 404 ms 1284 KB Output is correct
44 Correct 415 ms 1292 KB Output is correct
45 Correct 411 ms 1324 KB Output is correct
46 Correct 204 ms 1144 KB Output is correct
47 Correct 309 ms 1272 KB Output is correct
48 Correct 310 ms 1260 KB Output is correct