oj.uz

Submission #947136

# Submission time Handle Problem Language Result Execution time Memory
947136 2024-03-15T14:46:51 Z baluconisTima Cloud Computing (CEOI18_clo) C++14
90 / 100
 713 ms 1620 KB 
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ll long long
#define ld long double
#define f first
#define s second
#define pb push_back

using namespace std;
using namespace __gnu_pbds;

typedef tree<ll, null_type,
        less<ll>, rb_tree_tag,
        tree_order_statistics_node_update> oset;

mt19937_64 gen(time(0));
const ll N = 5007, M = 1000007;

int32_t main() {

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif



    ll m;
    cin >> m;
    vector<pair<ll,ll>> all;
    ll c[m], f[m], v[m];
    for(int i = 0; i < m; i++) {
        cin >> c[i] >> f[i] >> v[i];
        all.pb({f[i], i + 1});
    }
    ll n;
    cin >> n;
    ll c2[n], f2[n], v2[n];
    for(int i = 0; i < n; i++) {
       cin >> c2[i] >> f2[i] >> v2[i];
       all.pb({f2[i], -(i + 1)});
    }
    ll cost[m * 50 + 1];
    for(int i = 0; i < m * 50 + 1; i++) {
        cost[i] = -1e18;
    }
    cost[0] = 0;

    sort(all.rbegin(), all.rend());
    for(auto to: all) {
        if(to.s > 0) {
            ll x = to.s - 1;
            for(int i = m * 50 - c[x]; i >= c[x]; i--) {
                 cost[i] = max(cost[i], cost[i - c[x]] - v[x]);
            }
        } else {
             ll x = (-to.s - 1);
             for(int i = 0; i <= m * 50 - c2[x]; i++) {
                cost[i] = max(cost[i + c2[x]] + v2[x], cost[i]);
             }
        }

        for(int i = m * 50 - 1; i >= 0; i--) {
            cost[i] = max(cost[i], cost[i + 1]);
        }
    }

    cout << cost[0] << '\n';




}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 4 ms 600 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 4 ms 604 KB Output is correct
8 Correct 3 ms 604 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 72 ms 876 KB Output is correct
6 Correct 71 ms 856 KB Output is correct
7 Correct 355 ms 1368 KB Output is correct
8 Correct 366 ms 1372 KB Output is correct
9 Correct 326 ms 1112 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 7 ms 348 KB Output is correct
6 Correct 7 ms 580 KB Output is correct
7 Correct 11 ms 348 KB Output is correct
8 Correct 11 ms 348 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 201 ms 980 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 664 ms 1620 KB Output is correct
6 Correct 692 ms 1372 KB Output is correct
7 Correct 688 ms 1488 KB Output is correct
8 Correct 651 ms 1460 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 40 ms 604 KB Output is correct
4 Correct 141 ms 876 KB Output is correct
5 Correct 678 ms 1504 KB Output is correct
6 Correct 696 ms 1480 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 4 ms 600 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 4 ms 604 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 72 ms 876 KB Output is correct
14 Correct 71 ms 856 KB Output is correct
15 Correct 355 ms 1368 KB Output is correct
16 Correct 366 ms 1372 KB Output is correct
17 Correct 326 ms 1112 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 2 ms 460 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 7 ms 348 KB Output is correct
23 Correct 7 ms 580 KB Output is correct
24 Correct 11 ms 348 KB Output is correct
25 Correct 11 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 201 ms 980 KB Output is correct
29 Correct 3 ms 348 KB Output is correct
30 Correct 664 ms 1620 KB Output is correct
31 Correct 692 ms 1372 KB Output is correct
32 Correct 688 ms 1488 KB Output is correct
33 Correct 651 ms 1460 KB Output is correct
34 Correct 1 ms 600 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 40 ms 604 KB Output is correct
37 Correct 141 ms 876 KB Output is correct
38 Correct 678 ms 1504 KB Output is correct
39 Correct 696 ms 1480 KB Output is correct
40 Correct 49 ms 696 KB Output is correct
41 Correct 130 ms 860 KB Output is correct
42 Correct 404 ms 1112 KB Output is correct
43 Incorrect 713 ms 1616 KB Output isn't correct
44 Halted 0 ms 0 KB -