oj.uz

Submission #897231

# Submission time Handle Problem Language Result Execution time Memory
897231 2024-01-02T18:58:45 Z vanea Cloud Computing (CEOI18_clo) C++14
100 / 100
 350 ms 1624 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int mxN = 1e5+1;
const ll NINF = -1e18;

ll dp[mxN+10];

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    vector<array<int, 3>> v;
    for(int i = 0; i < n; i++) {
        int cores, freq, price;
        cin >> cores >> freq >> price;
        v.push_back({cores, freq, price});
    }
    int m;
    cin >> m;
    for(int i = 0; i < m; i++) {
        int cores, freq, price;
        cin >> cores >> freq >> price;
        cores = -cores;
        v.push_back({cores, freq, price});
    }
    sort(v.begin(), v.end(), [&](array<int, 3> a, array<int, 3> b) {
        if(a[1] == b[1]) {
            return a[0] > b[0];
        }
        else return a[1] > b[1];
    });
    for(int i = 0; i <= mxN; i++) {
        dp[i] = NINF;
    }
    dp[0] = 0;
    for(auto it : v) {
        int cores = it[0];
        if(cores > 0) {
            for(int i = mxN; i >= cores; i--) {
                if(dp[i-cores] != NINF) {
                    dp[i] = max(dp[i], dp[i-cores]-it[2]);
                }
            }
        }
        else {
            for(int i = abs(cores); i <= mxN; i++) {
                if(dp[i] != NINF)
                    dp[i+cores] = max(dp[i+cores], dp[i]+it[2]);
            }
        }
    }
    ll ans = 0;
    for(int i = 0; i <= mxN; i++) {
        ans = max(ans, dp[i]);
    }
    cout << ans;
    return 0;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 7 ms 1116 KB Output is correct
4 Correct 14 ms 1116 KB Output is correct
5 Correct 119 ms 1116 KB Output is correct
6 Correct 124 ms 1304 KB Output is correct
7 Correct 136 ms 1316 KB Output is correct
8 Correct 125 ms 1116 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 7 ms 1252 KB Output is correct
4 Correct 7 ms 1116 KB Output is correct
5 Correct 59 ms 1116 KB Output is correct
6 Correct 59 ms 1264 KB Output is correct
7 Correct 134 ms 1112 KB Output is correct
8 Correct 126 ms 1112 KB Output is correct
9 Correct 139 ms 1368 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1112 KB Output is correct
2 Correct 3 ms 1116 KB Output is correct
3 Correct 12 ms 1252 KB Output is correct
4 Correct 12 ms 1112 KB Output is correct
5 Correct 33 ms 1368 KB Output is correct
6 Correct 23 ms 1112 KB Output is correct
7 Correct 32 ms 1272 KB Output is correct
8 Correct 32 ms 1112 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1116 KB Output is correct
2 Correct 2 ms 1116 KB Output is correct
3 Correct 98 ms 1368 KB Output is correct
4 Correct 114 ms 1112 KB Output is correct
5 Correct 284 ms 1624 KB Output is correct
6 Correct 350 ms 1368 KB Output is correct
7 Correct 333 ms 1368 KB Output is correct
8 Correct 327 ms 1372 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 12 ms 1248 KB Output is correct
3 Correct 54 ms 1248 KB Output is correct
4 Correct 127 ms 1292 KB Output is correct
5 Correct 330 ms 1620 KB Output is correct
6 Correct 341 ms 1340 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 7 ms 1116 KB Output is correct
4 Correct 14 ms 1116 KB Output is correct
5 Correct 119 ms 1116 KB Output is correct
6 Correct 124 ms 1304 KB Output is correct
7 Correct 136 ms 1316 KB Output is correct
8 Correct 125 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 7 ms 1252 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 59 ms 1116 KB Output is correct
14 Correct 59 ms 1264 KB Output is correct
15 Correct 134 ms 1112 KB Output is correct
16 Correct 126 ms 1112 KB Output is correct
17 Correct 139 ms 1368 KB Output is correct
18 Correct 3 ms 1112 KB Output is correct
19 Correct 3 ms 1116 KB Output is correct
20 Correct 12 ms 1252 KB Output is correct
21 Correct 12 ms 1112 KB Output is correct
22 Correct 33 ms 1368 KB Output is correct
23 Correct 23 ms 1112 KB Output is correct
24 Correct 32 ms 1272 KB Output is correct
25 Correct 32 ms 1112 KB Output is correct
26 Correct 2 ms 1116 KB Output is correct
27 Correct 2 ms 1116 KB Output is correct
28 Correct 98 ms 1368 KB Output is correct
29 Correct 114 ms 1112 KB Output is correct
30 Correct 284 ms 1624 KB Output is correct
31 Correct 350 ms 1368 KB Output is correct
32 Correct 333 ms 1368 KB Output is correct
33 Correct 327 ms 1372 KB Output is correct
34 Correct 1 ms 1116 KB Output is correct
35 Correct 12 ms 1248 KB Output is correct
36 Correct 54 ms 1248 KB Output is correct
37 Correct 127 ms 1292 KB Output is correct
38 Correct 330 ms 1620 KB Output is correct
39 Correct 341 ms 1340 KB Output is correct
40 Correct 67 ms 1116 KB Output is correct
41 Correct 132 ms 1352 KB Output is correct
42 Correct 195 ms 1348 KB Output is correct
43 Correct 297 ms 1368 KB Output is correct
44 Correct 292 ms 1372 KB Output is correct
45 Correct 314 ms 1412 KB Output is correct
46 Correct 127 ms 1364 KB Output is correct
47 Correct 190 ms 1372 KB Output is correct
48 Correct 182 ms 1372 KB Output is correct