oj.uz

Submission #1006268

# Submission time Handle Problem Language Result Execution time Memory
1006268 2024-06-23T15:56:10 Z devariaota Cloud Computing (CEOI18_clo) C++17
100 / 100
 284 ms 1440 KB 
#include <bits/stdc++.h>
using namespace std;

# define int long long
# define fir first
# define sec second
# define pb push_back
# define endl "\n"

const int cnst = 1e5+55;
bool mutipletestcase = 0;
//bool debug = false;

bool sorting(tuple<int, int, int, bool> a, tuple<int, int, int, bool> b) {
    auto[a1, a2, a3, a4] = a;
    auto[b1, b2, b3, b4] = b;
    if(a1 == b1) return a4 > b4;
    return a1 < b1;
}

void solve() {
    int n; cin >> n;

    vector<tuple<int, int, int, bool>> vec;

    for(int i = 1; i<=n; i++) {
        int a, b, c; cin >> a >> b >> c;
        vec.pb({b, a, c, 0});
    }

    int m; cin >> m;

    for(int i = 1; i<=m; i++) {
        int a, b, c; cin >> a >> b >> c;
        vec.pb({b, a, c, 1});
    }

    sort(vec.begin(), vec.end(), sorting);
    reverse(vec.begin(), vec.end());

    int dp[cnst]; dp[0] = 0;
    for(int i = 1; i<=1e5; i++) dp[i] = 1e18*-1;
    
    for(auto [pow, fre, cos, id]: vec) {
        if(!id) {
            for(int i = 1e5; i>=fre; i--) dp[i] = max(dp[i], dp[i-fre]-cos);
        }
        else {
            for(int i = 0; i<=1e5-fre; i++) dp[i] = max(dp[i], dp[i+fre]+cos);
        }

        // for(int i = 1; i<=10; i++) cerr << dp[i] << " "; cerr << endl;
    }

    int ans = 0;
    for(int i = 0; i<=1e5; i++) ans = max(ans, dp[i]);
    cout << ans << endl; 
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(0);
    int t = 1;
    if(mutipletestcase) cin >> t; 
    while(t--) solve();
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 9 ms 1236 KB Output is correct
4 Correct 18 ms 1116 KB Output is correct
5 Correct 148 ms 1344 KB Output is correct
6 Correct 151 ms 1112 KB Output is correct
7 Correct 165 ms 1344 KB Output is correct
8 Correct 176 ms 1116 KB Output is correct

Subtask #2
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 7 ms 1116 KB Output is correct
4 Correct 7 ms 1240 KB Output is correct
5 Correct 55 ms 1116 KB Output is correct
6 Correct 59 ms 1116 KB Output is correct
7 Correct 128 ms 1112 KB Output is correct
8 Correct 119 ms 1116 KB Output is correct
9 Correct 119 ms 1116 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1112 KB Output is correct
2 Correct 3 ms 1116 KB Output is correct
3 Correct 13 ms 1116 KB Output is correct
4 Correct 13 ms 1248 KB Output is correct
5 Correct 24 ms 1116 KB Output is correct
6 Correct 26 ms 1116 KB Output is correct
7 Correct 34 ms 1116 KB Output is correct
8 Correct 34 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 83 ms 1328 KB Output is correct
4 Correct 143 ms 1116 KB Output is correct
5 Correct 237 ms 1372 KB Output is correct
6 Correct 254 ms 1368 KB Output is correct
7 Correct 267 ms 1368 KB Output is correct
8 Correct 242 ms 1368 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 12 ms 1244 KB Output is correct
3 Correct 52 ms 1116 KB Output is correct
4 Correct 144 ms 1116 KB Output is correct
5 Correct 279 ms 1372 KB Output is correct
6 Correct 272 ms 1368 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 9 ms 1236 KB Output is correct
4 Correct 18 ms 1116 KB Output is correct
5 Correct 148 ms 1344 KB Output is correct
6 Correct 151 ms 1112 KB Output is correct
7 Correct 165 ms 1344 KB Output is correct
8 Correct 176 ms 1116 KB Output is correct
9 Correct 1 ms 1112 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 7 ms 1116 KB Output is correct
12 Correct 7 ms 1240 KB Output is correct
13 Correct 55 ms 1116 KB Output is correct
14 Correct 59 ms 1116 KB Output is correct
15 Correct 128 ms 1112 KB Output is correct
16 Correct 119 ms 1116 KB Output is correct
17 Correct 119 ms 1116 KB Output is correct
18 Correct 3 ms 1112 KB Output is correct
19 Correct 3 ms 1116 KB Output is correct
20 Correct 13 ms 1116 KB Output is correct
21 Correct 13 ms 1248 KB Output is correct
22 Correct 24 ms 1116 KB Output is correct
23 Correct 26 ms 1116 KB Output is correct
24 Correct 34 ms 1116 KB Output is correct
25 Correct 34 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 83 ms 1328 KB Output is correct
29 Correct 143 ms 1116 KB Output is correct
30 Correct 237 ms 1372 KB Output is correct
31 Correct 254 ms 1368 KB Output is correct
32 Correct 267 ms 1368 KB Output is correct
33 Correct 242 ms 1368 KB Output is correct
34 Correct 1 ms 1112 KB Output is correct
35 Correct 12 ms 1244 KB Output is correct
36 Correct 52 ms 1116 KB Output is correct
37 Correct 144 ms 1116 KB Output is correct
38 Correct 279 ms 1372 KB Output is correct
39 Correct 272 ms 1368 KB Output is correct
40 Correct 72 ms 1116 KB Output is correct
41 Correct 141 ms 1112 KB Output is correct
42 Correct 227 ms 1372 KB Output is correct
43 Correct 269 ms 1372 KB Output is correct
44 Correct 271 ms 1372 KB Output is correct
45 Correct 284 ms 1372 KB Output is correct
46 Correct 142 ms 1116 KB Output is correct
47 Correct 207 ms 1440 KB Output is correct
48 Correct 207 ms 1436 KB Output is correct