oj.uz

Submission #483371

# Submission time Handle Problem Language Result Execution time Memory
483371 2021-10-29T00:37:22 Z john256 Cloud Computing (CEOI18_clo) C++14
100 / 100
 678 ms 1948 KB 
#include <bits/stdc++.h>
using namespace std;

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

int main() {
	vector<Transaction> poss_transactions; //possible transactions

	int max_CPUS = 0; //max # of CPUS
	
	int N; cin >> N; //# of computers available
	for(int x=0; x<N; x++) {
		Transaction trans;
		cin >> trans.cores >> trans.rate >> trans.price;
		trans.price = -trans.price;
		poss_transactions.push_back(trans);
		max_CPUS += trans.cores;
	}

	int M; cin >> M; //# of orders from customers
	for(int y=0; y<M; y++) {
		Transaction trans;
		cin >> trans.cores >> trans.rate >> trans.price;
		trans.cores = -trans.cores;
		poss_transactions.push_back(trans);
	}

	//The clock rate issue goes away if we process the orders in order.
	sort(
		poss_transactions.begin(), poss_transactions.end(),
			[](const Transaction& a, const Transaction& b) {
				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_CPUS+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_CPUS; c++) {
			int prev_comp = c - t.cores;
			if(0 <= prev_comp && prev_comp <= max_CPUS
					&& max_profits[prev_comp] != INT64_MIN) {
				new_max[c] = max(new_max[c], max_profits[prev_comp] + t.price);
			}
		}
		max_profits = new_max;
	}
	cout << *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 0 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 336 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 4 ms 332 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 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 37 ms 656 KB Output is correct
6 Correct 2 ms 204 KB Output is correct
7 Correct 169 ms 1136 KB Output is correct
8 Correct 33 ms 460 KB Output is correct
9 Correct 291 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 1 ms 332 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 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 13 ms 332 KB Output is correct
4 Correct 4 ms 332 KB Output is correct
5 Correct 333 ms 1172 KB Output is correct
6 Correct 667 ms 1800 KB Output is correct
7 Correct 645 ms 1800 KB Output is correct
8 Correct 671 ms 1740 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 44 ms 704 KB Output is correct
4 Correct 10 ms 352 KB Output is correct
5 Correct 652 ms 1768 KB Output is correct
6 Correct 646 ms 1780 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 0 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 336 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 4 ms 332 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 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 37 ms 656 KB Output is correct
14 Correct 2 ms 204 KB Output is correct
15 Correct 169 ms 1136 KB Output is correct
16 Correct 33 ms 460 KB Output is correct
17 Correct 291 ms 1696 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 332 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 1 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 13 ms 332 KB Output is correct
29 Correct 4 ms 332 KB Output is correct
30 Correct 333 ms 1172 KB Output is correct
31 Correct 667 ms 1800 KB Output is correct
32 Correct 645 ms 1800 KB Output is correct
33 Correct 671 ms 1740 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 44 ms 704 KB Output is correct
37 Correct 10 ms 352 KB Output is correct
38 Correct 652 ms 1768 KB Output is correct
39 Correct 646 ms 1780 KB Output is correct
40 Correct 42 ms 664 KB Output is correct
41 Correct 114 ms 844 KB Output is correct
42 Correct 10 ms 376 KB Output is correct
43 Correct 678 ms 1940 KB Output is correct
44 Correct 669 ms 1948 KB Output is correct
45 Correct 631 ms 1868 KB Output is correct
46 Correct 5 ms 332 KB Output is correct
47 Correct 10 ms 380 KB Output is correct
48 Correct 9 ms 332 KB Output is correct