oj.uz

Submission #947162

# Submission time Handle Problem Language Result Execution time Memory
947162 2024-03-15T15:18:06 Z NextBasilisk Cloud Computing (CEOI18_clo) C++14
18 / 100
 401 ms 1572 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, -1e9); 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
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 3 ms 584 KB Output is correct
6 Incorrect 2 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
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 38 ms 860 KB Output is correct
6 Correct 38 ms 860 KB Output is correct
7 Correct 186 ms 1372 KB Output is correct
8 Incorrect 189 ms 1372 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 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 Incorrect 4 ms 572 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 108 ms 1168 KB Output is correct
4 Correct 4 ms 348 KB Output is correct
5 Incorrect 316 ms 1524 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
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 21 ms 604 KB Output is correct
4 Correct 74 ms 1108 KB Output is correct
5 Correct 401 ms 1572 KB Output is correct
6 Correct 389 ms 1488 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 3 ms 584 KB Output is correct
6 Incorrect 2 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -