oj.uz

Submission #531853

# Submission time Handle Problem Language Result Execution time Memory
531853 2022-03-01T17:19:40 Z Falcon Cloud Computing (CEOI18_clo) C++17
100 / 100
 447 ms 1348 KB 
#include <bits/stdc++.h>

#ifdef DEBUG
    #include "debug.hpp"

    #define debug(x...)                                                        \
        do {                                                                   \
            ++dbg::depth;                                                      \
            string dbg_vals = dbg::to_string(x);                               \
            --dbg::depth;                                                      \
            dbg::fprint(__func__, __LINE__, #x, dbg_vals);                     \
        } while (false)
#else
    #define debug(...) 42
#endif

using namespace std;

template<typename T> inline T& ckmin(T& a, T b) { return a = a > b ? b : a; }
template<typename T> inline T& ckmax(T& a, T b) { return a = a < b ? b : a; }

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    constexpr int M{50 * 2000};
    constexpr long long INF{1LL << 50};

    vector<tuple<int, int, int>> a;

    int n; cin >> n;
    for (int i{}; i < n; ++i) {
        int c, f, v; cin >> c >> f >> v;
        a.push_back({-f, -v, c});
    }

    int m; cin >> m;
    for (int i{}; i < m; ++i) {
        int c, f, v; cin >> c >> f >> v;
        a.push_back({-f, v, -c});
    }

    sort(a.begin(), a.end());    

    array<long long, M + 1> dp{};
    fill(dp.begin() + 1, dp.end(), -INF);

    for (auto [_, v, c]: a) {
        if (v < 0)
            for (int i{M - c}; i >= 0; --i)
                ckmax(dp[i + c], dp[i] + v);

        if (v > 0)
            for (int i{-c}; i <= M; ++i)
                ckmax(dp[i + c], dp[i] + v);
    }

    cout << *max_element(dp.begin(), dp.end()) << '\n';

    return 0;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 10 ms 1092 KB Output is correct
4 Correct 19 ms 1108 KB Output is correct
5 Correct 189 ms 1160 KB Output is correct
6 Correct 199 ms 1168 KB Output is correct
7 Correct 174 ms 1100 KB Output is correct
8 Correct 180 ms 1156 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 2 ms 972 KB Output is correct
3 Correct 10 ms 1088 KB Output is correct
4 Correct 11 ms 972 KB Output is correct
5 Correct 100 ms 1116 KB Output is correct
6 Correct 80 ms 1108 KB Output is correct
7 Correct 173 ms 1168 KB Output is correct
8 Correct 171 ms 1160 KB Output is correct
9 Correct 184 ms 1132 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1092 KB Output is correct
2 Correct 3 ms 972 KB Output is correct
3 Correct 16 ms 1100 KB Output is correct
4 Correct 16 ms 1108 KB Output is correct
5 Correct 33 ms 1092 KB Output is correct
6 Correct 33 ms 1100 KB Output is correct
7 Correct 43 ms 1096 KB Output is correct
8 Correct 43 ms 1100 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1152 KB Output is correct
2 Correct 3 ms 972 KB Output is correct
3 Correct 130 ms 1124 KB Output is correct
4 Correct 171 ms 1100 KB Output is correct
5 Correct 324 ms 1348 KB Output is correct
6 Correct 447 ms 1208 KB Output is correct
7 Correct 348 ms 1232 KB Output is correct
8 Correct 366 ms 1228 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 972 KB Output is correct
2 Correct 17 ms 1100 KB Output is correct
3 Correct 72 ms 1104 KB Output is correct
4 Correct 180 ms 1132 KB Output is correct
5 Correct 340 ms 1228 KB Output is correct
6 Correct 359 ms 1200 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 10 ms 1092 KB Output is correct
4 Correct 19 ms 1108 KB Output is correct
5 Correct 189 ms 1160 KB Output is correct
6 Correct 199 ms 1168 KB Output is correct
7 Correct 174 ms 1100 KB Output is correct
8 Correct 180 ms 1156 KB Output is correct
9 Correct 1 ms 972 KB Output is correct
10 Correct 2 ms 972 KB Output is correct
11 Correct 10 ms 1088 KB Output is correct
12 Correct 11 ms 972 KB Output is correct
13 Correct 100 ms 1116 KB Output is correct
14 Correct 80 ms 1108 KB Output is correct
15 Correct 173 ms 1168 KB Output is correct
16 Correct 171 ms 1160 KB Output is correct
17 Correct 184 ms 1132 KB Output is correct
18 Correct 3 ms 1092 KB Output is correct
19 Correct 3 ms 972 KB Output is correct
20 Correct 16 ms 1100 KB Output is correct
21 Correct 16 ms 1108 KB Output is correct
22 Correct 33 ms 1092 KB Output is correct
23 Correct 33 ms 1100 KB Output is correct
24 Correct 43 ms 1096 KB Output is correct
25 Correct 43 ms 1100 KB Output is correct
26 Correct 3 ms 1152 KB Output is correct
27 Correct 3 ms 972 KB Output is correct
28 Correct 130 ms 1124 KB Output is correct
29 Correct 171 ms 1100 KB Output is correct
30 Correct 324 ms 1348 KB Output is correct
31 Correct 447 ms 1208 KB Output is correct
32 Correct 348 ms 1232 KB Output is correct
33 Correct 366 ms 1228 KB Output is correct
34 Correct 2 ms 972 KB Output is correct
35 Correct 17 ms 1100 KB Output is correct
36 Correct 72 ms 1104 KB Output is correct
37 Correct 180 ms 1132 KB Output is correct
38 Correct 340 ms 1228 KB Output is correct
39 Correct 359 ms 1200 KB Output is correct
40 Correct 95 ms 1100 KB Output is correct
41 Correct 183 ms 1140 KB Output is correct
42 Correct 266 ms 1192 KB Output is correct
43 Correct 358 ms 1228 KB Output is correct
44 Correct 348 ms 1232 KB Output is correct
45 Correct 332 ms 1260 KB Output is correct
46 Correct 169 ms 1100 KB Output is correct
47 Correct 260 ms 1220 KB Output is correct
48 Correct 245 ms 1200 KB Output is correct