oj.uz

Submission #949976

# Submission time Handle Problem Language Result Execution time Memory
949976 2024-03-20T02:19:41 Z berr Cloud Computing (CEOI18_clo) C++17
100 / 100
 458 ms 1372 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long


signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n; cin >> n;

    vector<array<int, 3>> comp(n);
    
    for(auto &[c, f, v]: comp) cin >> c >> f >> v;

    sort(comp.begin(), comp.end(), [&](auto i, auto j){
        return i[1] > j[1];
    });

    vector<int> val(n*50+2, (int)-1e18);
    val[0] = 0;

    int m; cin >> m;

    vector<array<int, 3>> cust(m);

    for(auto &[c, f, v]: cust) cin >> c >> f >> v;

    sort(cust.begin(), cust.end(), [&](auto i, auto j){
        return i[1] > j[1];
    });

    int pos=0, s=val.size()-1;
    for(int i=0; i<m; i++){ 
        while(pos<n && comp[pos][1] >= cust[i][1]){
            for(int j=s; j>=0; j--){
                if(val[j]==(int)-1e18) continue;
                int v = j+comp[pos][0];
                
                val[v] = max(val[v], val[j] - comp[pos][2]);
            }
            pos++;
        }

        for(int j=cust[i][0]; j<=s; j++){
            val[j-cust[i][0]] = max(val[j-cust[i][0]], val[j]+cust[i][2]);
        }

    }

    int ans = 0;

    for(auto i: val) ans=max(ans, i);

    cout << ans;
}

Subtask #1
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 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 3 ms 544 KB Output is correct
6 Correct 2 ms 600 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 0 ms 348 KB Output is correct
2 Correct 1 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 41 ms 604 KB Output is correct
6 Correct 50 ms 604 KB Output is correct
7 Correct 186 ms 1116 KB Output is correct
8 Correct 198 ms 1116 KB Output is correct
9 Correct 195 ms 1112 KB Output is correct

Subtask #3
18.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 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 5 ms 348 KB Output is correct
6 Correct 5 ms 348 KB Output is correct
7 Correct 8 ms 572 KB Output is correct
8 Correct 7 ms 544 KB Output is correct

Subtask #4
18.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 107 ms 860 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 374 ms 1368 KB Output is correct
6 Correct 403 ms 1372 KB Output is correct
7 Correct 406 ms 1368 KB Output is correct
8 Correct 394 ms 1116 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 26 ms 604 KB Output is correct
4 Correct 81 ms 604 KB Output is correct
5 Correct 408 ms 1372 KB Output is correct
6 Correct 435 ms 1116 KB Output is correct

Subtask #6
10.0 / 10.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 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 3 ms 544 KB Output is correct
6 Correct 2 ms 600 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 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 41 ms 604 KB Output is correct
14 Correct 50 ms 604 KB Output is correct
15 Correct 186 ms 1116 KB Output is correct
16 Correct 198 ms 1116 KB Output is correct
17 Correct 195 ms 1112 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 5 ms 348 KB Output is correct
23 Correct 5 ms 348 KB Output is correct
24 Correct 8 ms 572 KB Output is correct
25 Correct 7 ms 544 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 107 ms 860 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 374 ms 1368 KB Output is correct
31 Correct 403 ms 1372 KB Output is correct
32 Correct 406 ms 1368 KB Output is correct
33 Correct 394 ms 1116 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 26 ms 604 KB Output is correct
37 Correct 81 ms 604 KB Output is correct
38 Correct 408 ms 1372 KB Output is correct
39 Correct 435 ms 1116 KB Output is correct
40 Correct 29 ms 604 KB Output is correct
41 Correct 79 ms 600 KB Output is correct
42 Correct 250 ms 1116 KB Output is correct
43 Correct 458 ms 1372 KB Output is correct
44 Correct 402 ms 1368 KB Output is correct
45 Correct 432 ms 1360 KB Output is correct
46 Correct 105 ms 860 KB Output is correct
47 Correct 242 ms 1020 KB Output is correct
48 Correct 236 ms 1112 KB Output is correct