oj.uz

Submission #981340

# Submission time Handle Problem Language Result Execution time Memory
981340 2024-05-13T05:10:19 Z kh0i Cloud Computing (CEOI18_clo) C++17
100 / 100
 317 ms 1628 KB 
#include "bits/stdc++.h"
using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...)
#endif

using ll = long long;
using pii = pair<int, int>;

#define F first
#define S second
#define sz(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll get_rand(ll l, ll r) {
    assert(l <= r);
    return uniform_int_distribution<ll> (l, r)(rng);
}

void solve(){
    int n, m;
    cin >> n;
    vector<tuple<ll, bool, ll, ll>> x;
    for(int i = 1; i <= n; ++i){
        int c, f, v;
        cin >> c >> f >> v;
        x.emplace_back(f, 1, c, v);
    }
    cin >> m;
    for(int i = 1; i <= m; ++i){
        int c, f, v;
        cin >> c >> f >> v;
        x.emplace_back(f, 0, c, v);
    }

    sort(all(x));
    reverse(all(x));

    int mx = 20 * 5000;

    vector<ll> dp(mx + 5, -1e16);
    dp[0] = 0;

    for(auto [f, t, c, v] : x){
        if(t)
            for(int i = mx; i - c >= 0; --i)
                dp[i] = max(dp[i], dp[i - c] - v);
        else
            for(int i = 0; i + c <= mx; ++i)
                dp[i] = max(dp[i], dp[i + c] + v);
    }
    cout << *max_element(all(dp));
}

int32_t main() {
    cin.tie(nullptr)->sync_with_stdio(0);
    #define task "troll"
    if(fopen(task".inp", "r")){
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    int test = 1;
//    cin >> test;
    for(int i = 1; i <= test; ++i){
//        cout << "Case #" << i << ": ";
        solve();
    }
    #ifdef LOCAL
        cerr << "\n[Time]: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms.\n";
    #endif
    return 0;
}

Compilation message

clo.cpp: In function 'int32_t main()':
clo.cpp:63:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   63 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:64:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 9 ms 1116 KB Output is correct
4 Correct 16 ms 1112 KB Output is correct
5 Correct 140 ms 1372 KB Output is correct
6 Correct 142 ms 1372 KB Output is correct
7 Correct 158 ms 1368 KB Output is correct
8 Correct 152 ms 1372 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 2 ms 1116 KB Output is correct
3 Correct 9 ms 1112 KB Output is correct
4 Correct 9 ms 1116 KB Output is correct
5 Correct 74 ms 1116 KB Output is correct
6 Correct 74 ms 1116 KB Output is correct
7 Correct 166 ms 1372 KB Output is correct
8 Correct 168 ms 1372 KB Output is correct
9 Correct 156 ms 1368 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1116 KB Output is correct
2 Correct 3 ms 1116 KB Output is correct
3 Correct 17 ms 1368 KB Output is correct
4 Correct 15 ms 1112 KB Output is correct
5 Correct 29 ms 1116 KB Output is correct
6 Correct 29 ms 1116 KB Output is correct
7 Correct 39 ms 1116 KB Output is correct
8 Correct 39 ms 1116 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1116 KB Output is correct
2 Correct 2 ms 1116 KB Output is correct
3 Correct 128 ms 1160 KB Output is correct
4 Correct 134 ms 1368 KB Output is correct
5 Correct 290 ms 1368 KB Output is correct
6 Correct 313 ms 1372 KB Output is correct
7 Correct 307 ms 1372 KB Output is correct
8 Correct 305 ms 1372 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 16 ms 1116 KB Output is correct
3 Correct 64 ms 1116 KB Output is correct
4 Correct 155 ms 1372 KB Output is correct
5 Correct 309 ms 1628 KB Output is correct
6 Correct 309 ms 1368 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 9 ms 1116 KB Output is correct
4 Correct 16 ms 1112 KB Output is correct
5 Correct 140 ms 1372 KB Output is correct
6 Correct 142 ms 1372 KB Output is correct
7 Correct 158 ms 1368 KB Output is correct
8 Correct 152 ms 1372 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 2 ms 1116 KB Output is correct
11 Correct 9 ms 1112 KB Output is correct
12 Correct 9 ms 1116 KB Output is correct
13 Correct 74 ms 1116 KB Output is correct
14 Correct 74 ms 1116 KB Output is correct
15 Correct 166 ms 1372 KB Output is correct
16 Correct 168 ms 1372 KB Output is correct
17 Correct 156 ms 1368 KB Output is correct
18 Correct 3 ms 1116 KB Output is correct
19 Correct 3 ms 1116 KB Output is correct
20 Correct 17 ms 1368 KB Output is correct
21 Correct 15 ms 1112 KB Output is correct
22 Correct 29 ms 1116 KB Output is correct
23 Correct 29 ms 1116 KB Output is correct
24 Correct 39 ms 1116 KB Output is correct
25 Correct 39 ms 1116 KB Output is correct
26 Correct 2 ms 1116 KB Output is correct
27 Correct 2 ms 1116 KB Output is correct
28 Correct 128 ms 1160 KB Output is correct
29 Correct 134 ms 1368 KB Output is correct
30 Correct 290 ms 1368 KB Output is correct
31 Correct 313 ms 1372 KB Output is correct
32 Correct 307 ms 1372 KB Output is correct
33 Correct 305 ms 1372 KB Output is correct
34 Correct 1 ms 1112 KB Output is correct
35 Correct 16 ms 1116 KB Output is correct
36 Correct 64 ms 1116 KB Output is correct
37 Correct 155 ms 1372 KB Output is correct
38 Correct 309 ms 1628 KB Output is correct
39 Correct 309 ms 1368 KB Output is correct
40 Correct 89 ms 1112 KB Output is correct
41 Correct 148 ms 1372 KB Output is correct
42 Correct 233 ms 1368 KB Output is correct
43 Correct 313 ms 1372 KB Output is correct
44 Correct 311 ms 1372 KB Output is correct
45 Correct 317 ms 1372 KB Output is correct
46 Correct 158 ms 1372 KB Output is correct
47 Correct 243 ms 1372 KB Output is correct
48 Correct 240 ms 1372 KB Output is correct