oj.uz

Submission #957451

# Submission time Handle Problem Language Result Execution time Memory
957451 2024-04-03T17:55:59 Z DragosC1 Cloud Computing (CEOI18_clo) C++17
100 / 100
 1453 ms 3924 KB 
#include <bits/stdc++.h>
using namespace std;

struct pc {
    int core;
    int freq;
    int value;
} pc1[2001], pc2[2001], a[4001];

bool csort(pc a, pc b) {
    if (a.freq > b.freq)
        return 1;
    else if (a.freq == b.freq && a.core > b.core)
        return 1;
    return 0;
}

long long dp[2][50 * 4001];

int main() {
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> pc1[i].core >> pc1[i].freq >> pc1[i].value;
        a[i] = {pc1[i].core, pc1[i].freq, -pc1[i].value};
    }
    int m;
    cin >> m;
    for (int i = 1; i <= m; i++) {
        cin >> pc2[i].core >> pc2[i].freq >> pc2[i].value;
        a[n + i] = {-pc2[i].core, pc2[i].freq, pc2[i].value};
    }
    int l = n + m;
    sort(a + 1, a + l + 1, csort);
    for (int i = 0; i <= 1; i++)
        for (int j = 0; j <= l * 50; j++)
            dp[i][j] = -1e18;
    dp[0][0] = 0;
    for (int i = 1; i <= l; i++) {
        for (int j = 0; j <= l * 50; j++)
            dp[i % 2][j] = dp[1 - i % 2][j];
        for (int j = 0; j <= l * 50; j++)
            if (j - a[i].core >= 0 && j - a[i].core <= l * 50)
                dp[i % 2][j] = max(dp[i % 2][j], dp[1 - i % 2][j - a[i].core] + a[i].value);
    }
    long long Max = 0;
    for (int i = 0; i <= l * 50; i++)
        Max = max(Max, dp[l % 2][i]);
    cout << Max << '\n';
    return 0;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 2392 KB Output is correct
4 Correct 5 ms 2396 KB Output is correct
5 Correct 320 ms 2652 KB Output is correct
6 Correct 328 ms 3160 KB Output is correct
7 Correct 357 ms 2824 KB Output is correct
8 Correct 367 ms 2828 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2448 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 76 ms 2652 KB Output is correct
6 Correct 73 ms 2652 KB Output is correct
7 Correct 364 ms 2652 KB Output is correct
8 Correct 353 ms 2652 KB Output is correct
9 Correct 332 ms 2652 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 3 ms 2392 KB Output is correct
4 Correct 3 ms 2396 KB Output is correct
5 Correct 12 ms 2652 KB Output is correct
6 Correct 12 ms 2652 KB Output is correct
7 Correct 22 ms 2648 KB Output is correct
8 Correct 22 ms 2648 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 225 ms 2652 KB Output is correct
4 Correct 303 ms 2744 KB Output is correct
5 Correct 1287 ms 3672 KB Output is correct
6 Correct 1418 ms 3680 KB Output is correct
7 Correct 1417 ms 3684 KB Output is correct
8 Correct 1353 ms 3676 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 3 ms 2396 KB Output is correct
3 Correct 59 ms 2676 KB Output is correct
4 Correct 356 ms 2648 KB Output is correct
5 Correct 1453 ms 3628 KB Output is correct
6 Correct 1359 ms 3668 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 2392 KB Output is correct
4 Correct 5 ms 2396 KB Output is correct
5 Correct 320 ms 2652 KB Output is correct
6 Correct 328 ms 3160 KB Output is correct
7 Correct 357 ms 2824 KB Output is correct
8 Correct 367 ms 2828 KB Output is correct
9 Correct 1 ms 2448 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 2 ms 2396 KB Output is correct
13 Correct 76 ms 2652 KB Output is correct
14 Correct 73 ms 2652 KB Output is correct
15 Correct 364 ms 2652 KB Output is correct
16 Correct 353 ms 2652 KB Output is correct
17 Correct 332 ms 2652 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 3 ms 2392 KB Output is correct
21 Correct 3 ms 2396 KB Output is correct
22 Correct 12 ms 2652 KB Output is correct
23 Correct 12 ms 2652 KB Output is correct
24 Correct 22 ms 2648 KB Output is correct
25 Correct 22 ms 2648 KB Output is correct
26 Correct 1 ms 2392 KB Output is correct
27 Correct 0 ms 2396 KB Output is correct
28 Correct 225 ms 2652 KB Output is correct
29 Correct 303 ms 2744 KB Output is correct
30 Correct 1287 ms 3672 KB Output is correct
31 Correct 1418 ms 3680 KB Output is correct
32 Correct 1417 ms 3684 KB Output is correct
33 Correct 1353 ms 3676 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 3 ms 2396 KB Output is correct
36 Correct 59 ms 2676 KB Output is correct
37 Correct 356 ms 2648 KB Output is correct
38 Correct 1453 ms 3628 KB Output is correct
39 Correct 1359 ms 3668 KB Output is correct
40 Correct 92 ms 2696 KB Output is correct
41 Correct 320 ms 2812 KB Output is correct
42 Correct 837 ms 3284 KB Output is correct
43 Correct 1406 ms 3688 KB Output is correct
44 Correct 1440 ms 3924 KB Output is correct
45 Correct 1390 ms 3728 KB Output is correct
46 Correct 341 ms 2652 KB Output is correct
47 Correct 761 ms 3280 KB Output is correct
48 Correct 734 ms 3268 KB Output is correct