oj.uz

Submission #1091757

# Submission time Handle Problem Language Result Execution time Memory
1091757 2024-09-22T03:22:58 Z gyg Cloud Computing (CEOI18_clo) C++17
100 / 100
 491 ms 2384 KB 
#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define arr array
const int MX_N = 2e3 + 5, MX_M = 2e3 + 5, MX_C = 1e5 + 5, INF = 1e15;

int n, m;
struct Evnt {
    bool is_gn;
    int cp, pwr, vl;
    bool operator<(Evnt othr) {
        if (othr.pwr == pwr) return (is_gn && !othr.is_gn);
        return pwr > othr.pwr;
    }
};
arr<Evnt, MX_N + MX_M> evnt;

arr<arr<int, MX_C>, 2> dp;
void cmp() {
    for (int c = 1; c <= 1e5; c++) dp[0][c] = -INF;
    dp[0][0] = 0;
    
    for (int i = 1; i <= n + m; i++) {
        int prty = i % 2, opp_prty = (i + 1) % 2;
        if (evnt[i].is_gn) {
            for (int c = 0; c <= 1e5; c++) {
                if (c - evnt[i].cp >= 0) dp[prty][c] = max(dp[opp_prty][c], dp[opp_prty][c - evnt[i].cp] - evnt[i].vl);
                else dp[prty][c] = dp[opp_prty][c];
            }    
        } else {
            for (int c = 0; c <= 1e5; c++) {
                if (c + evnt[i].cp <= 1e5) dp[prty][c] = max(dp[opp_prty][c], dp[opp_prty][c + evnt[i].cp] + evnt[i].vl);
                else dp[prty][c] = dp[opp_prty][c];
            }
        }
    }
}

signed main() {
    // freopen("cld.in", "r", stdin);
    cin >> n;
    for (int i = 1; i <= n; i++) {
        int cp, pwr, vl; cin >> cp >> pwr >> vl;
        evnt[i] = {true, cp, pwr, vl};
    }
    cin >> m;
    for (int i = 1; i <= m; i++) {
        int cp, pwr, vl; cin >> cp >> pwr >> vl;
        evnt[n + i] = {false, cp, pwr, vl};
    }
    sort(evnt.begin() + 1, evnt.begin() + n + m + 1);

    cmp();

    int ans = -INF;
    for (int c = 0; c <= 1e5; c++) ans = max(ans, dp[(n + m) % 2][c]);
    cout << ans << '\n';
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 2 ms 1884 KB Output is correct
3 Correct 18 ms 2000 KB Output is correct
4 Correct 27 ms 1884 KB Output is correct
5 Correct 247 ms 2036 KB Output is correct
6 Correct 239 ms 2036 KB Output is correct
7 Correct 252 ms 2040 KB Output is correct
8 Correct 289 ms 1884 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1884 KB Output is correct
2 Correct 2 ms 1880 KB Output is correct
3 Correct 12 ms 1884 KB Output is correct
4 Correct 12 ms 1884 KB Output is correct
5 Correct 92 ms 1884 KB Output is correct
6 Correct 91 ms 2008 KB Output is correct
7 Correct 201 ms 1884 KB Output is correct
8 Correct 245 ms 1884 KB Output is correct
9 Correct 198 ms 1884 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1884 KB Output is correct
2 Correct 4 ms 1884 KB Output is correct
3 Correct 21 ms 1880 KB Output is correct
4 Correct 21 ms 1880 KB Output is correct
5 Correct 41 ms 1884 KB Output is correct
6 Correct 46 ms 1884 KB Output is correct
7 Correct 57 ms 1988 KB Output is correct
8 Correct 55 ms 1880 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1880 KB Output is correct
2 Correct 3 ms 1884 KB Output is correct
3 Correct 156 ms 1884 KB Output is correct
4 Correct 220 ms 1880 KB Output is correct
5 Correct 414 ms 2136 KB Output is correct
6 Correct 448 ms 2148 KB Output is correct
7 Correct 491 ms 2384 KB Output is correct
8 Correct 448 ms 2136 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 24 ms 2092 KB Output is correct
3 Correct 86 ms 1880 KB Output is correct
4 Correct 221 ms 1884 KB Output is correct
5 Correct 447 ms 2128 KB Output is correct
6 Correct 468 ms 1880 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1880 KB Output is correct
2 Correct 2 ms 1884 KB Output is correct
3 Correct 18 ms 2000 KB Output is correct
4 Correct 27 ms 1884 KB Output is correct
5 Correct 247 ms 2036 KB Output is correct
6 Correct 239 ms 2036 KB Output is correct
7 Correct 252 ms 2040 KB Output is correct
8 Correct 289 ms 1884 KB Output is correct
9 Correct 1 ms 1884 KB Output is correct
10 Correct 2 ms 1880 KB Output is correct
11 Correct 12 ms 1884 KB Output is correct
12 Correct 12 ms 1884 KB Output is correct
13 Correct 92 ms 1884 KB Output is correct
14 Correct 91 ms 2008 KB Output is correct
15 Correct 201 ms 1884 KB Output is correct
16 Correct 245 ms 1884 KB Output is correct
17 Correct 198 ms 1884 KB Output is correct
18 Correct 4 ms 1884 KB Output is correct
19 Correct 4 ms 1884 KB Output is correct
20 Correct 21 ms 1880 KB Output is correct
21 Correct 21 ms 1880 KB Output is correct
22 Correct 41 ms 1884 KB Output is correct
23 Correct 46 ms 1884 KB Output is correct
24 Correct 57 ms 1988 KB Output is correct
25 Correct 55 ms 1880 KB Output is correct
26 Correct 3 ms 1880 KB Output is correct
27 Correct 3 ms 1884 KB Output is correct
28 Correct 156 ms 1884 KB Output is correct
29 Correct 220 ms 1880 KB Output is correct
30 Correct 414 ms 2136 KB Output is correct
31 Correct 448 ms 2148 KB Output is correct
32 Correct 491 ms 2384 KB Output is correct
33 Correct 448 ms 2136 KB Output is correct
34 Correct 1 ms 1880 KB Output is correct
35 Correct 24 ms 2092 KB Output is correct
36 Correct 86 ms 1880 KB Output is correct
37 Correct 221 ms 1884 KB Output is correct
38 Correct 447 ms 2128 KB Output is correct
39 Correct 468 ms 1880 KB Output is correct
40 Correct 118 ms 1880 KB Output is correct
41 Correct 221 ms 1884 KB Output is correct
42 Correct 343 ms 2108 KB Output is correct
43 Correct 466 ms 2140 KB Output is correct
44 Correct 448 ms 2140 KB Output is correct
45 Correct 442 ms 2192 KB Output is correct
46 Correct 223 ms 1880 KB Output is correct
47 Correct 337 ms 2112 KB Output is correct
48 Correct 322 ms 2116 KB Output is correct