oj.uz

Submission #989184

# Submission time Handle Problem Language Result Execution time Memory
989184 2024-05-27T17:06:28 Z parlimoos Cloud Computing (CEOI18_clo) C++14
100 / 100
 569 ms 4124 KB 
//Be Name KHODA
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
#define pb push_back
#define pp pop_back
#define lb lower_bound
#define ub upper_bound
#define arr(x) array<ll , x>
#define endl '\n'
#define cl clear
#define bg begin

int n , m , sum;
vector<arr(3)> a , b;
vector<int> ord;
ll dp[2][1000001] , o;

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

    cin >> n;
    for(int i = 0 ; i < n ; i++){
        int c , f , v;
        cin >> c >> f >> v;
        a.pb({c , f , v}) , b.pb({c , f , v}) , sum += c , o -= (1ll * v);
        for(int i = 0 ; i < c ; i++) ord.pb(f);
    }
    cin >> m;
    for(int i = 0 ; i < m ; i++){
        int c , f , v;
        cin >> c >> f >> v;
        a.pb({c , f , v});
    }
    sort(a.bg() , a.end() , [](arr(3) a , arr(3) b){
        return (a[1] < b[1]);
    });
    sort(ord.bg() , ord.end());
    for(int i = n + m - 1 ; i >= 0 ; i--){
        int di1 = (i & 1) , di2 = ((i + 1) & 1);
        for(int j = sum ; j >= 0 ; j--){
            dp[di1][j] = max(dp[di2][j] , dp[di1][j + 1]);
            if(j + a[i][0] <= sum and a[i][1] <= ord[j]) dp[di1][j] = max(dp[di1][j] , a[i][2] + dp[di2][j + a[i][0]]);
        }
    }
    cout << dp[0][0] + o;
}

Subtask #1
18.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 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 3 ms 580 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 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 31 ms 856 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 144 ms 1628 KB Output is correct
8 Correct 30 ms 604 KB Output is correct
9 Correct 247 ms 3868 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 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 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 10 ms 720 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 280 ms 1776 KB Output is correct
6 Correct 528 ms 3868 KB Output is correct
7 Correct 515 ms 3864 KB Output is correct
8 Correct 486 ms 2328 KB Output is correct

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 31 ms 1108 KB Output is correct
4 Correct 7 ms 604 KB Output is correct
5 Correct 472 ms 3868 KB Output is correct
6 Correct 530 ms 3868 KB Output is correct

Subtask #6
10.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 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 3 ms 580 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 31 ms 856 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 144 ms 1628 KB Output is correct
16 Correct 30 ms 604 KB Output is correct
17 Correct 247 ms 3868 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 10 ms 720 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 280 ms 1776 KB Output is correct
31 Correct 528 ms 3868 KB Output is correct
32 Correct 515 ms 3864 KB Output is correct
33 Correct 486 ms 2328 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 31 ms 1108 KB Output is correct
37 Correct 7 ms 604 KB Output is correct
38 Correct 472 ms 3868 KB Output is correct
39 Correct 530 ms 3868 KB Output is correct
40 Correct 33 ms 860 KB Output is correct
41 Correct 93 ms 1312 KB Output is correct
42 Correct 8 ms 604 KB Output is correct
43 Correct 569 ms 4124 KB Output is correct
44 Correct 535 ms 4120 KB Output is correct
45 Correct 546 ms 4120 KB Output is correct
46 Correct 4 ms 604 KB Output is correct
47 Correct 7 ms 752 KB Output is correct
48 Correct 7 ms 748 KB Output is correct