#include <iostream>
#include <vector>
#include <algorithm>
using std::cout;
using std::endl;
using std::vector;
struct Transaction {
int cores;
int rate;
int price;
};
/**
* https://oj.uz/problem/view/CEOI18_clo
* 4
* 4 2200 700
* 2 1800 10
* 20 2550 9999
* 4 2000 750
* 3
* 1 1500 300
* 6 1900 1500
* 3 2400 4550 should output 350
*/
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;
}
);
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;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
276 KB |
Output is correct |
4 |
Correct |
1 ms |
296 KB |
Output is correct |
5 |
Correct |
4 ms |
300 KB |
Output is correct |
6 |
Correct |
3 ms |
332 KB |
Output is correct |
7 |
Correct |
7 ms |
388 KB |
Output is correct |
8 |
Correct |
6 ms |
304 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
53 ms |
656 KB |
Output is correct |
6 |
Correct |
3 ms |
332 KB |
Output is correct |
7 |
Correct |
235 ms |
1200 KB |
Output is correct |
8 |
Correct |
46 ms |
460 KB |
Output is correct |
9 |
Correct |
399 ms |
1708 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 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 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
17 ms |
332 KB |
Output is correct |
4 |
Correct |
4 ms |
332 KB |
Output is correct |
5 |
Correct |
440 ms |
1232 KB |
Output is correct |
6 |
Correct |
830 ms |
1836 KB |
Output is correct |
7 |
Correct |
903 ms |
1836 KB |
Output is correct |
8 |
Correct |
802 ms |
1784 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
2 ms |
332 KB |
Output is correct |
3 |
Correct |
51 ms |
716 KB |
Output is correct |
4 |
Correct |
11 ms |
356 KB |
Output is correct |
5 |
Correct |
872 ms |
1772 KB |
Output is correct |
6 |
Correct |
895 ms |
1804 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
276 KB |
Output is correct |
4 |
Correct |
1 ms |
296 KB |
Output is correct |
5 |
Correct |
4 ms |
300 KB |
Output is correct |
6 |
Correct |
3 ms |
332 KB |
Output is correct |
7 |
Correct |
7 ms |
388 KB |
Output is correct |
8 |
Correct |
6 ms |
304 KB |
Output is correct |
9 |
Correct |
1 ms |
204 KB |
Output is correct |
10 |
Correct |
1 ms |
204 KB |
Output is correct |
11 |
Correct |
1 ms |
204 KB |
Output is correct |
12 |
Correct |
1 ms |
204 KB |
Output is correct |
13 |
Correct |
53 ms |
656 KB |
Output is correct |
14 |
Correct |
3 ms |
332 KB |
Output is correct |
15 |
Correct |
235 ms |
1200 KB |
Output is correct |
16 |
Correct |
46 ms |
460 KB |
Output is correct |
17 |
Correct |
399 ms |
1708 KB |
Output is correct |
18 |
Correct |
1 ms |
204 KB |
Output is correct |
19 |
Correct |
1 ms |
204 KB |
Output is correct |
20 |
Correct |
1 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 |
0 ms |
204 KB |
Output is correct |
28 |
Correct |
17 ms |
332 KB |
Output is correct |
29 |
Correct |
4 ms |
332 KB |
Output is correct |
30 |
Correct |
440 ms |
1232 KB |
Output is correct |
31 |
Correct |
830 ms |
1836 KB |
Output is correct |
32 |
Correct |
903 ms |
1836 KB |
Output is correct |
33 |
Correct |
802 ms |
1784 KB |
Output is correct |
34 |
Correct |
1 ms |
204 KB |
Output is correct |
35 |
Correct |
2 ms |
332 KB |
Output is correct |
36 |
Correct |
51 ms |
716 KB |
Output is correct |
37 |
Correct |
11 ms |
356 KB |
Output is correct |
38 |
Correct |
872 ms |
1772 KB |
Output is correct |
39 |
Correct |
895 ms |
1804 KB |
Output is correct |
40 |
Correct |
61 ms |
696 KB |
Output is correct |
41 |
Correct |
171 ms |
896 KB |
Output is correct |
42 |
Correct |
13 ms |
416 KB |
Output is correct |
43 |
Correct |
975 ms |
1996 KB |
Output is correct |
44 |
Correct |
966 ms |
2000 KB |
Output is correct |
45 |
Correct |
989 ms |
2040 KB |
Output is correct |
46 |
Correct |
7 ms |
360 KB |
Output is correct |
47 |
Correct |
13 ms |
332 KB |
Output is correct |
48 |
Correct |
13 ms |
416 KB |
Output is correct |