oj.uz

Submission #957449

# Submission time Handle Problem Language Result Execution time Memory
957449 2024-04-03T17:53:57 Z DragosC1 Cloud Computing (CEOI18_clo) C++17
72 / 100
 1393 ms 3920 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;
    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 2492 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 6 ms 2492 KB Output is correct
5 Correct 308 ms 2824 KB Output is correct
6 Correct 327 ms 2832 KB Output is correct
7 Correct 350 ms 2648 KB Output is correct
8 Correct 372 ms 2652 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 72 ms 2696 KB Output is correct
6 Correct 72 ms 2904 KB Output is correct
7 Correct 429 ms 2872 KB Output is correct
8 Correct 354 ms 2872 KB Output is correct
9 Correct 324 ms 2648 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 2396 KB Output is correct
3 Correct 4 ms 2396 KB Output is correct
4 Correct 3 ms 2392 KB Output is correct
5 Correct 12 ms 2652 KB Output is correct
6 Correct 14 ms 2660 KB Output is correct
7 Correct 22 ms 2652 KB Output is correct
8 Correct 22 ms 2652 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 206 ms 2704 KB Output is correct
4 Incorrect 293 ms 2760 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 3 ms 2396 KB Output is correct
3 Correct 57 ms 2684 KB Output is correct
4 Correct 339 ms 2844 KB Output is correct
5 Correct 1351 ms 3920 KB Output is correct
6 Correct 1393 ms 3676 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2492 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 6 ms 2492 KB Output is correct
5 Correct 308 ms 2824 KB Output is correct
6 Correct 327 ms 2832 KB Output is correct
7 Correct 350 ms 2648 KB Output is correct
8 Correct 372 ms 2652 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 2 ms 2396 KB Output is correct
12 Correct 2 ms 2396 KB Output is correct
13 Correct 72 ms 2696 KB Output is correct
14 Correct 72 ms 2904 KB Output is correct
15 Correct 429 ms 2872 KB Output is correct
16 Correct 354 ms 2872 KB Output is correct
17 Correct 324 ms 2648 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 4 ms 2396 KB Output is correct
21 Correct 3 ms 2392 KB Output is correct
22 Correct 12 ms 2652 KB Output is correct
23 Correct 14 ms 2660 KB Output is correct
24 Correct 22 ms 2652 KB Output is correct
25 Correct 22 ms 2652 KB Output is correct
26 Correct 1 ms 2392 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 206 ms 2704 KB Output is correct
29 Incorrect 293 ms 2760 KB Output isn't correct
30 Halted 0 ms 0 KB -