#include <bits/stdc++.h>
using namespace std;
struct Transaction {
int cores;
int rate;
int price;
};
int main() {
vector<Transaction> poss_transactions; //possible transactions
int maxC = 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);
maxC += 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;
});
/*
* dp[t][c] = the maximum profit we can gain from the first
* t transactions given that we have c cores left
*/
vector<long long> dp(maxC+1, INT64_MIN);
dp[0] = 0;
for(const Transaction& t : poss_transactions) {
vector<long long> dp2(dp); //updated dp array after transaction t
for(int c=0; c<=maxC; c++) {
int prev_comp = c - t.cores;
if(0 <= prev_comp && prev_comp <= maxC
&& dp[prev_comp] != INT64_MIN) {
dp2[c] = max(dp2[c], dp[prev_comp] + t.price);
}
}
dp = dp2;
}
cout << *max_element(dp.begin(), dp.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 |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
4 ms |
332 KB |
Output is correct |
6 |
Correct |
3 ms |
332 KB |
Output is correct |
7 |
Correct |
5 ms |
332 KB |
Output is correct |
8 |
Correct |
5 ms |
332 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
292 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
40 ms |
656 KB |
Output is correct |
6 |
Correct |
3 ms |
332 KB |
Output is correct |
7 |
Correct |
219 ms |
1204 KB |
Output is correct |
8 |
Correct |
35 ms |
460 KB |
Output is correct |
9 |
Correct |
304 ms |
1696 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 |
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 |
2 ms |
204 KB |
Output is correct |
8 |
Correct |
2 ms |
204 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 |
14 ms |
420 KB |
Output is correct |
4 |
Correct |
3 ms |
332 KB |
Output is correct |
5 |
Correct |
348 ms |
1228 KB |
Output is correct |
6 |
Correct |
659 ms |
1836 KB |
Output is correct |
7 |
Correct |
644 ms |
1800 KB |
Output is correct |
8 |
Correct |
589 ms |
1740 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
34 ms |
716 KB |
Output is correct |
4 |
Correct |
8 ms |
320 KB |
Output is correct |
5 |
Correct |
695 ms |
1840 KB |
Output is correct |
6 |
Correct |
620 ms |
1816 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 |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
4 ms |
332 KB |
Output is correct |
6 |
Correct |
3 ms |
332 KB |
Output is correct |
7 |
Correct |
5 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 |
292 KB |
Output is correct |
11 |
Correct |
0 ms |
204 KB |
Output is correct |
12 |
Correct |
0 ms |
204 KB |
Output is correct |
13 |
Correct |
40 ms |
656 KB |
Output is correct |
14 |
Correct |
3 ms |
332 KB |
Output is correct |
15 |
Correct |
219 ms |
1204 KB |
Output is correct |
16 |
Correct |
35 ms |
460 KB |
Output is correct |
17 |
Correct |
304 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 |
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 |
2 ms |
204 KB |
Output is correct |
25 |
Correct |
2 ms |
204 KB |
Output is correct |
26 |
Correct |
1 ms |
204 KB |
Output is correct |
27 |
Correct |
1 ms |
204 KB |
Output is correct |
28 |
Correct |
14 ms |
420 KB |
Output is correct |
29 |
Correct |
3 ms |
332 KB |
Output is correct |
30 |
Correct |
348 ms |
1228 KB |
Output is correct |
31 |
Correct |
659 ms |
1836 KB |
Output is correct |
32 |
Correct |
644 ms |
1800 KB |
Output is correct |
33 |
Correct |
589 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 |
34 ms |
716 KB |
Output is correct |
37 |
Correct |
8 ms |
320 KB |
Output is correct |
38 |
Correct |
695 ms |
1840 KB |
Output is correct |
39 |
Correct |
620 ms |
1816 KB |
Output is correct |
40 |
Correct |
38 ms |
668 KB |
Output is correct |
41 |
Correct |
134 ms |
892 KB |
Output is correct |
42 |
Correct |
11 ms |
432 KB |
Output is correct |
43 |
Correct |
683 ms |
2000 KB |
Output is correct |
44 |
Correct |
728 ms |
2000 KB |
Output is correct |
45 |
Correct |
742 ms |
2032 KB |
Output is correct |
46 |
Correct |
5 ms |
336 KB |
Output is correct |
47 |
Correct |
10 ms |
312 KB |
Output is correct |
48 |
Correct |
9 ms |
420 KB |
Output is correct |