oj.uz

Submission #963749

# Submission time Handle Problem Language Result Execution time Memory
963749 2024-04-15T15:24:53 Z Art_ogo Cloud Computing (CEOI18_clo) C++17
100 / 100
 485 ms 3924 KB 
#include <bits/stdc++.h>

#define ll long long
#define fi first
#define se second
#define ve vector
#define all(x) x.begin(), x.end()
#define pb(x) push_back(x)

using namespace std;

mt19937 rnd;

typedef pair<ll, ll> pll;
typedef pair<int, int> pii;

struct cpu{
    int c;
    ll f, v;
};

const int MAXN = 4048;
const int MAXC = 51*MAXN;

ll dp[2][MAXC];
cpu a[2*MAXN];

inline bool comp(const cpu& c1, const cpu& c2){
    if(c1.f == c2.f)
        return c1.c > c2.c;
    return c1.f > c2.f;
}

void solve(){
    int n;
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> a[i].c >> a[i].f >> a[i].v;
        a[i].v *= -1;
    }
    int m;
    cin >> m;
    for(int i = n + 1; i <= n + m; i++){
        cin >> a[i].c >> a[i].f >> a[i].v;
        a[i].c *= -1;
    }
    sort(a + 1, a + m + n + 1, comp);
    fill(dp[0], dp[0] + MAXC, -1e18);
    fill(dp[1], dp[1] + MAXC, -1e18);
    dp[0][0] = 0;
    for(int i = 1; i <= n + m; i++){
        int cur = i & 1;
        int prev = cur ^ 1;
        for(int j = 0; j < i*51; j++){
            dp[cur][j] = dp[prev][j];
            if(j - a[i].c >= 0 && j - a[i].c < MAXC)
                dp[cur][j] = max(dp[cur][j], dp[prev][j - a[i].c] + a[i].v);
        }
    }
    cout << *max_element(dp[(n + m) & 1], dp[(n + m) & 1] + MAXC);
}

signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    int T = 1;
    //    cin >> T;
    while(T--){
        solve();
    }
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3672 KB Output is correct
2 Correct 1 ms 3676 KB Output is correct
3 Correct 2 ms 3676 KB Output is correct
4 Correct 3 ms 3672 KB Output is correct
5 Correct 118 ms 3676 KB Output is correct
6 Correct 102 ms 3768 KB Output is correct
7 Correct 110 ms 3676 KB Output is correct
8 Correct 109 ms 3672 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3672 KB Output is correct
2 Correct 1 ms 3676 KB Output is correct
3 Correct 2 ms 3536 KB Output is correct
4 Correct 2 ms 3676 KB Output is correct
5 Correct 23 ms 3676 KB Output is correct
6 Correct 25 ms 3744 KB Output is correct
7 Correct 121 ms 3776 KB Output is correct
8 Correct 109 ms 3776 KB Output is correct
9 Correct 102 ms 3676 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3676 KB Output is correct
2 Correct 2 ms 3676 KB Output is correct
3 Correct 3 ms 3676 KB Output is correct
4 Correct 3 ms 3672 KB Output is correct
5 Correct 5 ms 3672 KB Output is correct
6 Correct 6 ms 3676 KB Output is correct
7 Correct 8 ms 3676 KB Output is correct
8 Correct 8 ms 3676 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3676 KB Output is correct
2 Correct 2 ms 3540 KB Output is correct
3 Correct 66 ms 3732 KB Output is correct
4 Correct 90 ms 3676 KB Output is correct
5 Correct 388 ms 3828 KB Output is correct
6 Correct 434 ms 3672 KB Output is correct
7 Correct 485 ms 3824 KB Output is correct
8 Correct 419 ms 3820 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3676 KB Output is correct
2 Correct 2 ms 3676 KB Output is correct
3 Correct 19 ms 3676 KB Output is correct
4 Correct 109 ms 3672 KB Output is correct
5 Correct 418 ms 3832 KB Output is correct
6 Correct 434 ms 3804 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3672 KB Output is correct
2 Correct 1 ms 3676 KB Output is correct
3 Correct 2 ms 3676 KB Output is correct
4 Correct 3 ms 3672 KB Output is correct
5 Correct 118 ms 3676 KB Output is correct
6 Correct 102 ms 3768 KB Output is correct
7 Correct 110 ms 3676 KB Output is correct
8 Correct 109 ms 3672 KB Output is correct
9 Correct 1 ms 3672 KB Output is correct
10 Correct 1 ms 3676 KB Output is correct
11 Correct 2 ms 3536 KB Output is correct
12 Correct 2 ms 3676 KB Output is correct
13 Correct 23 ms 3676 KB Output is correct
14 Correct 25 ms 3744 KB Output is correct
15 Correct 121 ms 3776 KB Output is correct
16 Correct 109 ms 3776 KB Output is correct
17 Correct 102 ms 3676 KB Output is correct
18 Correct 1 ms 3676 KB Output is correct
19 Correct 2 ms 3676 KB Output is correct
20 Correct 3 ms 3676 KB Output is correct
21 Correct 3 ms 3672 KB Output is correct
22 Correct 5 ms 3672 KB Output is correct
23 Correct 6 ms 3676 KB Output is correct
24 Correct 8 ms 3676 KB Output is correct
25 Correct 8 ms 3676 KB Output is correct
26 Correct 2 ms 3676 KB Output is correct
27 Correct 2 ms 3540 KB Output is correct
28 Correct 66 ms 3732 KB Output is correct
29 Correct 90 ms 3676 KB Output is correct
30 Correct 388 ms 3828 KB Output is correct
31 Correct 434 ms 3672 KB Output is correct
32 Correct 485 ms 3824 KB Output is correct
33 Correct 419 ms 3820 KB Output is correct
34 Correct 1 ms 3676 KB Output is correct
35 Correct 2 ms 3676 KB Output is correct
36 Correct 19 ms 3676 KB Output is correct
37 Correct 109 ms 3672 KB Output is correct
38 Correct 418 ms 3832 KB Output is correct
39 Correct 434 ms 3804 KB Output is correct
40 Correct 30 ms 3676 KB Output is correct
41 Correct 108 ms 3676 KB Output is correct
42 Correct 267 ms 3796 KB Output is correct
43 Correct 424 ms 3676 KB Output is correct
44 Correct 433 ms 3924 KB Output is correct
45 Correct 435 ms 3868 KB Output is correct
46 Correct 115 ms 3756 KB Output is correct
47 Correct 257 ms 3792 KB Output is correct
48 Correct 247 ms 3796 KB Output is correct