oj.uz

Submission #398992

# Submission time Handle Problem Language Result Execution time Memory
398992 2021-05-05T01:31:19 Z KoD Cloud Computing (CEOI18_clo) C++17
100 / 100
 299 ms 1984 KB 
#include <bits/stdc++.h>

using ll = long long;

template <class T>
using Vec = std::vector<T>;

constexpr ll INF = std::numeric_limits<ll>::max() / 2;

struct State {
    int c, f, v;
    bool t;
};

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int N;
    std::cin >> N;
    Vec<State> state;
    for (int i = 0; i < N; ++i) {
        int c, f, v;
        std::cin >> c >> f >> v;
        state.push_back(State{c, f, v, false});
    }
    int Q;
    std::cin >> Q;
    for (int i = 0; i < Q; ++i) {
        int c, f, v;
        std::cin >> c >> f >> v;
        state.push_back(State{c, f, v, true});
    }
    std::sort(state.begin(), state.end(), [&](const State& a, const State& b) {
        if (a.f != b.f) return a.f > b.f;
        return b.t;
    });
    Vec<ll> dp(1, 0);
    for (const auto [c, f, v, t]: state) {
        if (t) {
            for (int i = c; i < (int) dp.size(); ++i) {
                dp[i - c] = std::max(dp[i - c], dp[i] + v);
            }
        }
        else {
            const int cur = (int) dp.size();
            dp.resize(cur + c, -INF);
            for (int i = cur - 1; i >= 0; --i) {
                dp[i + c] = std::max(dp[i + c], dp[i] - v);
            }
        }
    }
    std::cout << *std::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 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 12 ms 804 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 63 ms 1176 KB Output is correct
8 Correct 8 ms 588 KB Output is correct
9 Correct 86 ms 1756 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 320 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 4 ms 332 KB Output is correct
4 Correct 4 ms 332 KB Output is correct
5 Correct 154 ms 1388 KB Output is correct
6 Correct 276 ms 1280 KB Output is correct
7 Correct 270 ms 1984 KB Output is correct
8 Correct 262 ms 1676 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 12 ms 716 KB Output is correct
4 Correct 4 ms 332 KB Output is correct
5 Correct 179 ms 1820 KB Output is correct
6 Correct 280 ms 1456 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 12 ms 804 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 63 ms 1176 KB Output is correct
16 Correct 8 ms 588 KB Output is correct
17 Correct 86 ms 1756 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 320 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 4 ms 332 KB Output is correct
29 Correct 4 ms 332 KB Output is correct
30 Correct 154 ms 1388 KB Output is correct
31 Correct 276 ms 1280 KB Output is correct
32 Correct 270 ms 1984 KB Output is correct
33 Correct 262 ms 1676 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 12 ms 716 KB Output is correct
37 Correct 4 ms 332 KB Output is correct
38 Correct 179 ms 1820 KB Output is correct
39 Correct 280 ms 1456 KB Output is correct
40 Correct 12 ms 716 KB Output is correct
41 Correct 38 ms 844 KB Output is correct
42 Correct 4 ms 460 KB Output is correct
43 Correct 298 ms 1340 KB Output is correct
44 Correct 299 ms 1384 KB Output is correct
45 Correct 201 ms 1412 KB Output is correct
46 Correct 2 ms 392 KB Output is correct
47 Correct 4 ms 460 KB Output is correct
48 Correct 4 ms 452 KB Output is correct