oj.uz

Submission #528026

# Submission time Handle Problem Language Result Execution time Memory
528026 2022-02-19T02:45:23 Z hoanghq2004 Cloud Computing (CEOI18_clo) C++14
100 / 100
 264 ms 1296 KB 
#include <bits/stdc++.h>
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;

const int N = 2010 * 50;

int n, m;
long long dp[N];

struct dta {
    int c, f, v, type;
    int operator < (const dta& other) const {
        if (f != other.f) return f > other.f;
        return type > other.type;
    }
};

int main() {
    ios :: sync_with_stdio(0); cin.tie(0);
    vector <dta> events;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        int c, f, v;
        cin >> c >> f >> v;
        events.push_back({c, f, v, 1});
    }
    cin >> m;
    for (int i = 0; i < m; ++i) {
        int c, f, v;
        cin >> c >> f >> v;
        events.push_back({c, f, v, -1});
    }
    sort(events.begin(), events.end());
    int cur = 0;
    memset(dp, - 60, sizeof(dp));
    dp[0] = 0;
    for (auto [c, f, v, type]: events) {
        if (type == 1) {
            for (int i = cur; i >= 0; --i)
                dp[i + c] = max(dp[i + c], dp[i] - v);
            cur += c;
        } else {
            for (int i = c; i <= cur; ++i)
                dp[i - c] = max(dp[i - c], dp[i] + v);
        }
    }
    cout << *max_element(dp, dp + N);
}

Compilation message

clo.cpp:2: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    2 | #pragma GCC optimization ("O3")
      | 
clo.cpp:3: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("unroll-loops")
      | 
clo.cpp: In function 'int main()':
clo.cpp:45:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   45 |     for (auto [c, f, v, type]: events) {
      |               ^

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 1100 KB Output is correct
3 Correct 1 ms 1088 KB Output is correct
4 Correct 1 ms 1100 KB Output is correct
5 Correct 2 ms 1092 KB Output is correct
6 Correct 1 ms 1092 KB Output is correct
7 Correct 3 ms 1228 KB Output is correct
8 Correct 2 ms 1100 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 1088 KB Output is correct
4 Correct 1 ms 1100 KB Output is correct
5 Correct 12 ms 1092 KB Output is correct
6 Correct 2 ms 1100 KB Output is correct
7 Correct 43 ms 1100 KB Output is correct
8 Correct 7 ms 1104 KB Output is correct
9 Correct 70 ms 1100 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1088 KB Output is correct
2 Correct 1 ms 1084 KB Output is correct
3 Correct 1 ms 1100 KB Output is correct
4 Correct 1 ms 1100 KB Output is correct
5 Correct 1 ms 1100 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Correct 1 ms 1092 KB Output is correct
8 Correct 1 ms 1100 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1088 KB Output is correct
2 Correct 1 ms 1088 KB Output is correct
3 Correct 4 ms 1100 KB Output is correct
4 Correct 2 ms 1100 KB Output is correct
5 Correct 119 ms 1260 KB Output is correct
6 Correct 222 ms 1248 KB Output is correct
7 Correct 253 ms 1268 KB Output is correct
8 Correct 204 ms 1228 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 10 ms 1140 KB Output is correct
4 Correct 4 ms 1100 KB Output is correct
5 Correct 155 ms 1268 KB Output is correct
6 Correct 219 ms 1236 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 1100 KB Output is correct
3 Correct 1 ms 1088 KB Output is correct
4 Correct 1 ms 1100 KB Output is correct
5 Correct 2 ms 1092 KB Output is correct
6 Correct 1 ms 1092 KB Output is correct
7 Correct 3 ms 1228 KB Output is correct
8 Correct 2 ms 1100 KB Output is correct
9 Correct 1 ms 1100 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 1 ms 1088 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 12 ms 1092 KB Output is correct
14 Correct 2 ms 1100 KB Output is correct
15 Correct 43 ms 1100 KB Output is correct
16 Correct 7 ms 1104 KB Output is correct
17 Correct 70 ms 1100 KB Output is correct
18 Correct 1 ms 1088 KB Output is correct
19 Correct 1 ms 1084 KB Output is correct
20 Correct 1 ms 1100 KB Output is correct
21 Correct 1 ms 1100 KB Output is correct
22 Correct 1 ms 1100 KB Output is correct
23 Correct 1 ms 1100 KB Output is correct
24 Correct 1 ms 1092 KB Output is correct
25 Correct 1 ms 1100 KB Output is correct
26 Correct 1 ms 1088 KB Output is correct
27 Correct 1 ms 1088 KB Output is correct
28 Correct 4 ms 1100 KB Output is correct
29 Correct 2 ms 1100 KB Output is correct
30 Correct 119 ms 1260 KB Output is correct
31 Correct 222 ms 1248 KB Output is correct
32 Correct 253 ms 1268 KB Output is correct
33 Correct 204 ms 1228 KB Output is correct
34 Correct 1 ms 1100 KB Output is correct
35 Correct 1 ms 1100 KB Output is correct
36 Correct 10 ms 1140 KB Output is correct
37 Correct 4 ms 1100 KB Output is correct
38 Correct 155 ms 1268 KB Output is correct
39 Correct 219 ms 1236 KB Output is correct
40 Correct 10 ms 1100 KB Output is correct
41 Correct 30 ms 1100 KB Output is correct
42 Correct 3 ms 1156 KB Output is correct
43 Correct 264 ms 1272 KB Output is correct
44 Correct 261 ms 1268 KB Output is correct
45 Correct 158 ms 1296 KB Output is correct
46 Correct 2 ms 1100 KB Output is correct
47 Correct 4 ms 1228 KB Output is correct
48 Correct 5 ms 1228 KB Output is correct