oj.uz

Submission #968817

# Submission time Handle Problem Language Result Execution time Memory
968817 2024-04-24T06:37:30 Z dosts Cloud Computing (CEOI18_clo) C++17
100 / 100
 926 ms 3924 KB 
//Dost SEFEROĞLU
#pragma GCC optimize("O3,unroll-loops,Ofast")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define ff first
#define ss second
#define sp << " " << 
#define vi vector<int>
const int N = 2e7+1,inf = 2e18,MOD = 1e9+7;

struct Order{
    int core,power,price;
};

void solve() {
    int n;
    cin >> n;
    vector<Order> orders;
    for (int i=1;i<=n;i++) {
        int c,f,p;
        cin >> c >> f >> p;
        orders.push_back({c,f,-p});
    }
    int m;
    cin >> m;
    for (int i=1;i<=m;i++) {
        int c,f,p;
        cin >> c >> f >> p;
        orders.push_back({-c,f,p});
    }    
    sort(orders.begin(),orders.end(),[&](Order o1,Order o2) {
        if (o1.power > o2.power) return true;
        if (o1.power < o2.power) return false;
        return o1.core > o2.core;
    });
    
    n = n+m;
    int dp[200001],dp2[200001];
    for (int i=0;i<=200000;i++) dp[i] = dp2[i] = -inf;
    dp2[0] = 0;
    for (int i=0;i<n;i++) {
        for (int j=0;j<=200000;j++) dp[j] = -inf;
        for (int c = 0;c<=200000;c++) {
            if (dp2[c] == -inf) continue;
            dp[c] = max(dp[c],dp2[c]);
            if (c+orders[i].core >= 0 && c+orders[i].core <= 200000) {
                dp[c+orders[i].core] =  max(dp[c+orders[i].core],dp2[c]+orders[i].price);
            }
        }
        for (int j=0;j<=200000;j++) dp2[j] = dp[j];
    }
    cout << max(0ll,*max_element(dp2,dp2+200001)) << '\n';
}
                
                            
signed main() { 
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    #ifdef Dodi
        freopen("in.txt","r",stdin);
        freopen("out.txt","w",stdout);
    #endif
    int t = 1;
    //cin >> t; 
    while (t --> 0) solve();
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3416 KB Output is correct
2 Correct 2 ms 3420 KB Output is correct
3 Correct 18 ms 3584 KB Output is correct
4 Correct 34 ms 3420 KB Output is correct
5 Correct 340 ms 3676 KB Output is correct
6 Correct 292 ms 3652 KB Output is correct
7 Correct 365 ms 3420 KB Output is correct
8 Correct 323 ms 3652 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3416 KB Output is correct
2 Correct 4 ms 3420 KB Output is correct
3 Correct 19 ms 3592 KB Output is correct
4 Correct 19 ms 3588 KB Output is correct
5 Correct 166 ms 3420 KB Output is correct
6 Correct 147 ms 3612 KB Output is correct
7 Correct 384 ms 3672 KB Output is correct
8 Correct 329 ms 3416 KB Output is correct
9 Correct 393 ms 3420 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 3420 KB Output is correct
2 Correct 7 ms 3416 KB Output is correct
3 Correct 31 ms 3592 KB Output is correct
4 Correct 38 ms 3420 KB Output is correct
5 Correct 59 ms 3416 KB Output is correct
6 Correct 82 ms 3580 KB Output is correct
7 Correct 83 ms 3604 KB Output is correct
8 Correct 80 ms 3420 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 3416 KB Output is correct
2 Correct 5 ms 3420 KB Output is correct
3 Correct 284 ms 3648 KB Output is correct
4 Correct 293 ms 3672 KB Output is correct
5 Correct 815 ms 3804 KB Output is correct
6 Correct 913 ms 3800 KB Output is correct
7 Correct 926 ms 3804 KB Output is correct
8 Correct 884 ms 3796 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3420 KB Output is correct
2 Correct 30 ms 3416 KB Output is correct
3 Correct 152 ms 3608 KB Output is correct
4 Correct 334 ms 3420 KB Output is correct
5 Correct 859 ms 3752 KB Output is correct
6 Correct 916 ms 3752 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3416 KB Output is correct
2 Correct 2 ms 3420 KB Output is correct
3 Correct 18 ms 3584 KB Output is correct
4 Correct 34 ms 3420 KB Output is correct
5 Correct 340 ms 3676 KB Output is correct
6 Correct 292 ms 3652 KB Output is correct
7 Correct 365 ms 3420 KB Output is correct
8 Correct 323 ms 3652 KB Output is correct
9 Correct 3 ms 3416 KB Output is correct
10 Correct 4 ms 3420 KB Output is correct
11 Correct 19 ms 3592 KB Output is correct
12 Correct 19 ms 3588 KB Output is correct
13 Correct 166 ms 3420 KB Output is correct
14 Correct 147 ms 3612 KB Output is correct
15 Correct 384 ms 3672 KB Output is correct
16 Correct 329 ms 3416 KB Output is correct
17 Correct 393 ms 3420 KB Output is correct
18 Correct 7 ms 3420 KB Output is correct
19 Correct 7 ms 3416 KB Output is correct
20 Correct 31 ms 3592 KB Output is correct
21 Correct 38 ms 3420 KB Output is correct
22 Correct 59 ms 3416 KB Output is correct
23 Correct 82 ms 3580 KB Output is correct
24 Correct 83 ms 3604 KB Output is correct
25 Correct 80 ms 3420 KB Output is correct
26 Correct 5 ms 3416 KB Output is correct
27 Correct 5 ms 3420 KB Output is correct
28 Correct 284 ms 3648 KB Output is correct
29 Correct 293 ms 3672 KB Output is correct
30 Correct 815 ms 3804 KB Output is correct
31 Correct 913 ms 3800 KB Output is correct
32 Correct 926 ms 3804 KB Output is correct
33 Correct 884 ms 3796 KB Output is correct
34 Correct 3 ms 3420 KB Output is correct
35 Correct 30 ms 3416 KB Output is correct
36 Correct 152 ms 3608 KB Output is correct
37 Correct 334 ms 3420 KB Output is correct
38 Correct 859 ms 3752 KB Output is correct
39 Correct 916 ms 3752 KB Output is correct
40 Correct 176 ms 3420 KB Output is correct
41 Correct 336 ms 3672 KB Output is correct
42 Correct 505 ms 3776 KB Output is correct
43 Correct 621 ms 3676 KB Output is correct
44 Correct 713 ms 3816 KB Output is correct
45 Correct 646 ms 3840 KB Output is correct
46 Correct 320 ms 3676 KB Output is correct
47 Correct 493 ms 3676 KB Output is correct
48 Correct 505 ms 3924 KB Output is correct