oj.uz

Submission #947167

# Submission time Handle Problem Language Result Execution time Memory
947167 2024-03-15T15:21:02 Z NextBasilisk Cloud Computing (CEOI18_clo) C++14
100 / 100
 365 ms 1516 KB 
#include <bits/stdc++.h>
#include <iostream>

#define ll long long
#define pb push_back
#define F first
#define S second

using namespace std;

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

    ll n;
    cin >> n;

    vector<pair<pair<ll,ll>, pair<ll,ll> > > action;

    for(ll i = 0; i < n; i++){
        ll c, f, v;
        cin >> c >> f >> v;
        action.pb({{f, 1}, {v, c}});
    }

    ll m;
    cin >> m;

    for(ll i = 0; i < m; i++){
        ll c, f, v;
        cin >> c >> f >> v;
        action.pb({{f, 0}, {v, c}});
    }

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

    vector<ll> ans(50 * n + 1, -1e18); ans[0] = 0;

    while(!action.empty()){
        ll curC = action[action.size() - 1].S.S;
        ll curV = action[action.size() - 1].S.F;
        ll curT = action[action.size() - 1].F.S;

        if(curT == 1){
            for(ll i = 50 * n - curC; i >= 0; i--){
                if(ans[i + curC] < ans[i] - curV){
                    ans[i + curC] = ans[i] - curV;
                }
            }
        }
        else{
            for(ll i = curC; i <= 50 * n; i++){
                if(ans[i - curC] < ans[i] + curV){
                    ans[i - curC] = ans[i] + curV;
                }
            }
        }
        action.pop_back();
    }

    ll ansG = 0;

    for(int i = 0; i < ans.size(); i++){
        ansG = max(ansG, ans[i]);
        //cout << ans[i] << endl;
    }

    cout << ansG << endl;
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:63:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |     for(int i = 0; i < ans.size(); i++){
      |                    ~~^~~~~~~~~~~~

Subtask #1
18.0 / 18.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 500 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 39 ms 860 KB Output is correct
6 Correct 48 ms 856 KB Output is correct
7 Correct 206 ms 1516 KB Output is correct
8 Correct 199 ms 1376 KB Output is correct
9 Correct 185 ms 1348 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 352 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 6 ms 588 KB Output is correct
6 Correct 4 ms 360 KB Output is correct
7 Correct 7 ms 348 KB Output is correct
8 Correct 6 ms 352 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 356 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 135 ms 1160 KB Output is correct
4 Correct 2 ms 352 KB Output is correct
5 Correct 342 ms 1484 KB Output is correct
6 Correct 329 ms 1496 KB Output is correct
7 Correct 336 ms 1496 KB Output is correct
8 Correct 336 ms 1460 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 24 ms 728 KB Output is correct
4 Correct 61 ms 860 KB Output is correct
5 Correct 365 ms 1472 KB Output is correct
6 Correct 350 ms 1488 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 1 ms 500 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 39 ms 860 KB Output is correct
14 Correct 48 ms 856 KB Output is correct
15 Correct 206 ms 1516 KB Output is correct
16 Correct 199 ms 1376 KB Output is correct
17 Correct 185 ms 1348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 352 KB Output is correct
20 Correct 1 ms 352 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 6 ms 588 KB Output is correct
23 Correct 4 ms 360 KB Output is correct
24 Correct 7 ms 348 KB Output is correct
25 Correct 6 ms 352 KB Output is correct
26 Correct 0 ms 356 KB Output is correct
27 Correct 1 ms 352 KB Output is correct
28 Correct 135 ms 1160 KB Output is correct
29 Correct 2 ms 352 KB Output is correct
30 Correct 342 ms 1484 KB Output is correct
31 Correct 329 ms 1496 KB Output is correct
32 Correct 336 ms 1496 KB Output is correct
33 Correct 336 ms 1460 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 24 ms 728 KB Output is correct
37 Correct 61 ms 860 KB Output is correct
38 Correct 365 ms 1472 KB Output is correct
39 Correct 350 ms 1488 KB Output is correct
40 Correct 21 ms 604 KB Output is correct
41 Correct 57 ms 860 KB Output is correct
42 Correct 187 ms 1116 KB Output is correct
43 Correct 331 ms 1484 KB Output is correct
44 Correct 334 ms 1484 KB Output is correct
45 Correct 336 ms 1368 KB Output is correct
46 Correct 78 ms 856 KB Output is correct
47 Correct 173 ms 1112 KB Output is correct
48 Correct 196 ms 1260 KB Output is correct