oj.uz

Submission #571898

# Submission time Handle Problem Language Result Execution time Memory
571898 2022-06-03T06:02:34 Z piOOE Cloud Computing (CEOI18_clo) C++17
100 / 100
 1674 ms 1356 KB 
#include <bits/stdc++.h>

using namespace std;

#define sz(x) ((int)size(x))
#define all(x) begin(x), end(x)
#define trace(x) cout << #x << ": " << (x) << endl;

typedef long long ll;

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

int rand(int l, int r) { return (int) ((ll) rnd() % (r - l + 1)) + l; }

const int N = 2000, C = 50;
const ll infL = 3e18;

ll dp[C * N + 1];


int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vector<array<int, 4>> a;
    for (int i = 0; i < n; ++i) {
        int c, f, v;
        cin >> c >> f >> v;
        a.push_back({f, 1, c, v});
    }
    int m;
    cin >> m;
    int sum = N * C;
    for (int i = 0; i < m; ++i) {
        int c, f, v;
        cin >> c >> f >> v;
        a.push_back({f, 0, c, v});
    }
    sort(all(a));
    for (auto [f, t, c, v] : a) {
        if (t == 0) {
            for (int k = sum; k >= c; --k) {
                dp[k] = max(dp[k], dp[k - c] + v);
            }
        } else {
            for (int k = c; k <= sum; ++k) {
                dp[k - c] = max(dp[k - c], dp[k] - v);
            }
        }
        for (int k = 1; k <= sum; ++k) {
            dp[k] = max(dp[k], dp[k - 1]);
        }
    }
    cout << dp[0];
    return 0;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 980 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct
3 Correct 46 ms 1100 KB Output is correct
4 Correct 90 ms 1108 KB Output is correct
5 Correct 800 ms 1152 KB Output is correct
6 Correct 792 ms 1108 KB Output is correct
7 Correct 831 ms 1200 KB Output is correct
8 Correct 850 ms 1200 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 980 KB Output is correct
2 Correct 6 ms 1104 KB Output is correct
3 Correct 47 ms 1088 KB Output is correct
4 Correct 45 ms 1108 KB Output is correct
5 Correct 383 ms 1124 KB Output is correct
6 Correct 379 ms 1124 KB Output is correct
7 Correct 861 ms 1156 KB Output is correct
8 Correct 847 ms 1152 KB Output is correct
9 Correct 828 ms 1168 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1108 KB Output is correct
2 Correct 14 ms 980 KB Output is correct
3 Correct 75 ms 1108 KB Output is correct
4 Correct 75 ms 1108 KB Output is correct
5 Correct 158 ms 1228 KB Output is correct
6 Correct 157 ms 1108 KB Output is correct
7 Correct 209 ms 1108 KB Output is correct
8 Correct 210 ms 1108 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 980 KB Output is correct
2 Correct 7 ms 980 KB Output is correct
3 Correct 648 ms 1152 KB Output is correct
4 Correct 771 ms 1152 KB Output is correct
5 Correct 1552 ms 1216 KB Output is correct
6 Correct 1668 ms 1216 KB Output is correct
7 Correct 1643 ms 1236 KB Output is correct
8 Correct 1652 ms 1236 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1108 KB Output is correct
2 Correct 70 ms 1112 KB Output is correct
3 Correct 334 ms 1132 KB Output is correct
4 Correct 853 ms 1156 KB Output is correct
5 Correct 1672 ms 1236 KB Output is correct
6 Correct 1667 ms 1216 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 980 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct
3 Correct 46 ms 1100 KB Output is correct
4 Correct 90 ms 1108 KB Output is correct
5 Correct 800 ms 1152 KB Output is correct
6 Correct 792 ms 1108 KB Output is correct
7 Correct 831 ms 1200 KB Output is correct
8 Correct 850 ms 1200 KB Output is correct
9 Correct 2 ms 980 KB Output is correct
10 Correct 6 ms 1104 KB Output is correct
11 Correct 47 ms 1088 KB Output is correct
12 Correct 45 ms 1108 KB Output is correct
13 Correct 383 ms 1124 KB Output is correct
14 Correct 379 ms 1124 KB Output is correct
15 Correct 861 ms 1156 KB Output is correct
16 Correct 847 ms 1152 KB Output is correct
17 Correct 828 ms 1168 KB Output is correct
18 Correct 13 ms 1108 KB Output is correct
19 Correct 14 ms 980 KB Output is correct
20 Correct 75 ms 1108 KB Output is correct
21 Correct 75 ms 1108 KB Output is correct
22 Correct 158 ms 1228 KB Output is correct
23 Correct 157 ms 1108 KB Output is correct
24 Correct 209 ms 1108 KB Output is correct
25 Correct 210 ms 1108 KB Output is correct
26 Correct 8 ms 980 KB Output is correct
27 Correct 7 ms 980 KB Output is correct
28 Correct 648 ms 1152 KB Output is correct
29 Correct 771 ms 1152 KB Output is correct
30 Correct 1552 ms 1216 KB Output is correct
31 Correct 1668 ms 1216 KB Output is correct
32 Correct 1643 ms 1236 KB Output is correct
33 Correct 1652 ms 1236 KB Output is correct
34 Correct 3 ms 1108 KB Output is correct
35 Correct 70 ms 1112 KB Output is correct
36 Correct 334 ms 1132 KB Output is correct
37 Correct 853 ms 1156 KB Output is correct
38 Correct 1672 ms 1236 KB Output is correct
39 Correct 1667 ms 1216 KB Output is correct
40 Correct 438 ms 1144 KB Output is correct
41 Correct 804 ms 1176 KB Output is correct
42 Correct 1285 ms 1252 KB Output is correct
43 Correct 1674 ms 1356 KB Output is correct
44 Correct 1662 ms 1284 KB Output is correct
45 Correct 1662 ms 1312 KB Output is correct
46 Correct 849 ms 1184 KB Output is correct
47 Correct 1263 ms 1252 KB Output is correct
48 Correct 1244 ms 1356 KB Output is correct