oj.uz

Submission #957764

# Submission time Handle Problem Language Result Execution time Memory
957764 2024-04-04T09:23:43 Z LucaIlie Cloud Computing (CEOI18_clo) C++17
100 / 100
 323 ms 1384 KB 
#include <bits/stdc++.h>

using namespace std;

struct task {
    int t, c, f, v;
};

const int MAX_N = 2000;
const int MAX_M = 2000;
const int MAX_C = 50;
const int MAX_CORES = MAX_M * MAX_C;
const long long INF = 1e15;
vector<task> events;
long long dp[MAX_CORES + 1];

int main() {
    int n, m;

    cin >> n;
    for ( int i = 0; i < n; i++ ) {
        int c, f, v;
        cin >> c >> f >> v;
        events.push_back( { 0, c, f, v } );
    }
    cin >> m;
    for ( int i = 0; i < m; i++ ) {
        int c, f, v;
        cin >> c >> f >> v;
        events.push_back( { 1, c, f, v } );
    }

    sort( events.begin(), events.end(), []( task a, task b ) {
        if ( a.f == b.f )
            return a.t < b.t;
        return a.f > b.f;
    } );

    dp[0] = 0;
    for ( int p = 1; p <= MAX_CORES; p++ )
        dp[p] = -INF;
    for ( auto e: events ) {
        if ( e.t == 0 ) {
            for ( int p = MAX_CORES; p - e.c >= 0; p-- )
                dp[p] = max( dp[p], dp[p - e.c] - e.v );
        } else {
            for ( int p = 0; p + e.c <= MAX_CORES; p++ )
                dp[p] = max( dp[p], dp[p + e.c] + e.v );
        }
    }

    long long ans = 0;
    for ( int p = 0; p <= MAX_CORES; p++ )
        ans = max( ans, dp[p] );

    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 9 ms 1228 KB Output is correct
4 Correct 16 ms 1232 KB Output is correct
5 Correct 168 ms 1300 KB Output is correct
6 Correct 144 ms 1116 KB Output is correct
7 Correct 152 ms 1116 KB Output is correct
8 Correct 160 ms 1304 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 2 ms 1116 KB Output is correct
3 Correct 9 ms 1112 KB Output is correct
4 Correct 9 ms 1116 KB Output is correct
5 Correct 75 ms 1228 KB Output is correct
6 Correct 74 ms 1116 KB Output is correct
7 Correct 169 ms 1116 KB Output is correct
8 Correct 174 ms 1300 KB Output is correct
9 Correct 157 ms 1112 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1116 KB Output is correct
2 Correct 3 ms 1212 KB Output is correct
3 Correct 15 ms 1116 KB Output is correct
4 Correct 14 ms 1116 KB Output is correct
5 Correct 29 ms 1116 KB Output is correct
6 Correct 29 ms 1112 KB Output is correct
7 Correct 43 ms 1116 KB Output is correct
8 Correct 47 ms 1220 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 124 ms 1116 KB Output is correct
4 Correct 134 ms 1276 KB Output is correct
5 Correct 292 ms 1372 KB Output is correct
6 Correct 320 ms 1372 KB Output is correct
7 Correct 323 ms 1376 KB Output is correct
8 Correct 301 ms 1372 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 13 ms 1116 KB Output is correct
3 Correct 65 ms 1116 KB Output is correct
4 Correct 154 ms 1116 KB Output is correct
5 Correct 321 ms 1380 KB Output is correct
6 Correct 318 ms 1112 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 9 ms 1228 KB Output is correct
4 Correct 16 ms 1232 KB Output is correct
5 Correct 168 ms 1300 KB Output is correct
6 Correct 144 ms 1116 KB Output is correct
7 Correct 152 ms 1116 KB Output is correct
8 Correct 160 ms 1304 KB Output is correct
9 Correct 1 ms 1112 KB Output is correct
10 Correct 2 ms 1116 KB Output is correct
11 Correct 9 ms 1112 KB Output is correct
12 Correct 9 ms 1116 KB Output is correct
13 Correct 75 ms 1228 KB Output is correct
14 Correct 74 ms 1116 KB Output is correct
15 Correct 169 ms 1116 KB Output is correct
16 Correct 174 ms 1300 KB Output is correct
17 Correct 157 ms 1112 KB Output is correct
18 Correct 4 ms 1116 KB Output is correct
19 Correct 3 ms 1212 KB Output is correct
20 Correct 15 ms 1116 KB Output is correct
21 Correct 14 ms 1116 KB Output is correct
22 Correct 29 ms 1116 KB Output is correct
23 Correct 29 ms 1112 KB Output is correct
24 Correct 43 ms 1116 KB Output is correct
25 Correct 47 ms 1220 KB Output is correct
26 Correct 2 ms 1116 KB Output is correct
27 Correct 2 ms 1116 KB Output is correct
28 Correct 124 ms 1116 KB Output is correct
29 Correct 134 ms 1276 KB Output is correct
30 Correct 292 ms 1372 KB Output is correct
31 Correct 320 ms 1372 KB Output is correct
32 Correct 323 ms 1376 KB Output is correct
33 Correct 301 ms 1372 KB Output is correct
34 Correct 1 ms 1112 KB Output is correct
35 Correct 13 ms 1116 KB Output is correct
36 Correct 65 ms 1116 KB Output is correct
37 Correct 154 ms 1116 KB Output is correct
38 Correct 321 ms 1380 KB Output is correct
39 Correct 318 ms 1112 KB Output is correct
40 Correct 86 ms 1112 KB Output is correct
41 Correct 149 ms 1284 KB Output is correct
42 Correct 233 ms 1372 KB Output is correct
43 Correct 307 ms 1368 KB Output is correct
44 Correct 321 ms 1384 KB Output is correct
45 Correct 310 ms 1372 KB Output is correct
46 Correct 160 ms 1116 KB Output is correct
47 Correct 231 ms 1368 KB Output is correct
48 Correct 229 ms 1368 KB Output is correct