oj.uz

Submission #481891

# Submission time Handle Problem Language Result Execution time Memory
481891 2021-10-22T07:08:44 Z keertan Cloud Computing (CEOI18_clo) C++17
100 / 100
 725 ms 1968 KB 
#include <iostream>
#include <vector>
#include <algorithm>

using std::cout;
using std::endl;
using std::vector;

struct Transaction {
	int cores;
	int rate;
	int price;
};

int main() {
	vector<Transaction> poss_transactions;
	int max_computers = 0;
	int comp_num;
	std::cin >> comp_num;
	for (int c = 0; c < comp_num; c++) {
		Transaction trans;
		std::cin >> trans.cores >> trans.rate >> trans.price;
		trans.price = -trans.price;
		poss_transactions.push_back(trans);
		max_computers += trans.cores;
	}
	int order_num;
	std::cin >> order_num;
	for (int o = 0; o < order_num; o++) {
		Transaction trans;
		std::cin >> trans.cores >> trans.rate >> trans.price;
		trans.cores = -trans.cores;
		poss_transactions.push_back(trans);
	}
	/*
	 * if we sort like this, then the entire clock rate issue
	 * goes away as long as we process them in order
	 */
	std::sort(
		poss_transactions.begin(), poss_transactions.end(),
		[] (const Transaction& a, const Transaction& b) -> bool {
			return a.rate != b.rate ? a.rate > b.rate : a.price < b.price;
		}
	);

	/*
	 * max_profits[t][c] = the maximum profit we can gain from the first
	 * t transactions given that we have c cores left
	 */
	vector<long long> max_profits(max_computers + 1, INT64_MIN);
	max_profits[0] = 0;
	for (const Transaction& t : poss_transactions) {
		vector<long long> new_max(max_profits);
		for (int c = 0; c <= max_computers; c++) {
			int prev_comp = c - t.cores;
			if (0 <= prev_comp && prev_comp <= max_computers
					&& max_profits[prev_comp] != INT64_MIN) {
				new_max[c] = std::max(new_max[c], max_profits[prev_comp] + t.price);
			}
		}
		max_profits = new_max;
	}
	cout << *std::max_element(max_profits.begin(), max_profits.end()) << endl;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 4 ms 336 KB Output is correct
8 Correct 5 ms 332 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 36 ms 676 KB Output is correct
6 Correct 3 ms 320 KB Output is correct
7 Correct 202 ms 1136 KB Output is correct
8 Correct 33 ms 580 KB Output is correct
9 Correct 287 ms 1696 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 12 ms 332 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 355 ms 1172 KB Output is correct
6 Correct 640 ms 1800 KB Output is correct
7 Correct 642 ms 1800 KB Output is correct
8 Correct 704 ms 1740 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 38 ms 716 KB Output is correct
4 Correct 10 ms 348 KB Output is correct
5 Correct 610 ms 1760 KB Output is correct
6 Correct 689 ms 1740 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 4 ms 336 KB Output is correct
8 Correct 5 ms 332 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 36 ms 676 KB Output is correct
14 Correct 3 ms 320 KB Output is correct
15 Correct 202 ms 1136 KB Output is correct
16 Correct 33 ms 580 KB Output is correct
17 Correct 287 ms 1696 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 12 ms 332 KB Output is correct
29 Correct 3 ms 332 KB Output is correct
30 Correct 355 ms 1172 KB Output is correct
31 Correct 640 ms 1800 KB Output is correct
32 Correct 642 ms 1800 KB Output is correct
33 Correct 704 ms 1740 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 38 ms 716 KB Output is correct
37 Correct 10 ms 348 KB Output is correct
38 Correct 610 ms 1760 KB Output is correct
39 Correct 689 ms 1740 KB Output is correct
40 Correct 46 ms 664 KB Output is correct
41 Correct 115 ms 868 KB Output is correct
42 Correct 9 ms 332 KB Output is correct
43 Correct 687 ms 1968 KB Output is correct
44 Correct 710 ms 1944 KB Output is correct
45 Correct 725 ms 1940 KB Output is correct
46 Correct 7 ms 332 KB Output is correct
47 Correct 9 ms 332 KB Output is correct
48 Correct 9 ms 332 KB Output is correct