oj.uz

Submission #965553

# Submission time Handle Problem Language Result Execution time Memory
965553 2024-04-18T21:23:57 Z Charizard2021 Cloud Computing (CEOI18_clo) C++17
100 / 100
 856 ms 2392 KB 
#include<bits/stdc++.h>
using namespace std;
struct Object{
    int c, f, v;
    bool operator< (const Object& o) const{
        return (f == o.f && v < o.v) || (f > o.f);
    }
};
int main(){
    int n;
    cin >> n;
    vector<Object> objects;
    for(int i = 0; i < n; i++){
        int c, f, v;
        cin >> c >> f >> v;
        objects.push_back({c, f, -v});
    }
    int m;
    cin >> m;
    for(int i = 0; i < m; i++){
        int c, f, v;
        cin >> c >> f >> v;
        objects.push_back({-c, f, v});
    }
    sort(objects.begin(), objects.end());
    vector<long long> dp(100001, -1e14);
    dp[0] = 0;
    for(int i = 0; i < n + m; i++){
        vector<long long> ndp(100001, -1e14);
        ndp[0] = 0;
        for(int c = 0; c <= 100000; c++){
            if(c - objects[i].c <= 100000 && objects[i].c <= c){
                ndp[c] = max(ndp[c], dp[c - objects[i].c] + objects[i].v);
            }
        }
        for(int c = 0; c <= 100000; c++){
            dp[c] = max(dp[c], ndp[c]);
        }
    }
    long long maxVal = -1e14;
    for(int i = 0; i <= 100000; i++){
        maxVal = max(maxVal, dp[i]);
    }
    cout << maxVal << "\n";
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1884 KB Output is correct
2 Correct 3 ms 1880 KB Output is correct
3 Correct 23 ms 1884 KB Output is correct
4 Correct 43 ms 1884 KB Output is correct
5 Correct 399 ms 1880 KB Output is correct
6 Correct 402 ms 1880 KB Output is correct
7 Correct 427 ms 1884 KB Output is correct
8 Correct 415 ms 1884 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1884 KB Output is correct
2 Correct 3 ms 1884 KB Output is correct
3 Correct 23 ms 1880 KB Output is correct
4 Correct 23 ms 1884 KB Output is correct
5 Correct 189 ms 1880 KB Output is correct
6 Correct 190 ms 1884 KB Output is correct
7 Correct 413 ms 1880 KB Output is correct
8 Correct 422 ms 2072 KB Output is correct
9 Correct 403 ms 1884 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1880 KB Output is correct
2 Correct 7 ms 1884 KB Output is correct
3 Correct 38 ms 1884 KB Output is correct
4 Correct 38 ms 1884 KB Output is correct
5 Correct 76 ms 1884 KB Output is correct
6 Correct 79 ms 1884 KB Output is correct
7 Correct 112 ms 1880 KB Output is correct
8 Correct 104 ms 1884 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1884 KB Output is correct
2 Correct 5 ms 1884 KB Output is correct
3 Correct 319 ms 1996 KB Output is correct
4 Correct 376 ms 1884 KB Output is correct
5 Correct 771 ms 2140 KB Output is correct
6 Correct 819 ms 2136 KB Output is correct
7 Correct 827 ms 2136 KB Output is correct
8 Correct 842 ms 2136 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1884 KB Output is correct
2 Correct 34 ms 1884 KB Output is correct
3 Correct 167 ms 1884 KB Output is correct
4 Correct 418 ms 1884 KB Output is correct
5 Correct 833 ms 2140 KB Output is correct
6 Correct 829 ms 2120 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1884 KB Output is correct
2 Correct 3 ms 1880 KB Output is correct
3 Correct 23 ms 1884 KB Output is correct
4 Correct 43 ms 1884 KB Output is correct
5 Correct 399 ms 1880 KB Output is correct
6 Correct 402 ms 1880 KB Output is correct
7 Correct 427 ms 1884 KB Output is correct
8 Correct 415 ms 1884 KB Output is correct
9 Correct 2 ms 1884 KB Output is correct
10 Correct 3 ms 1884 KB Output is correct
11 Correct 23 ms 1880 KB Output is correct
12 Correct 23 ms 1884 KB Output is correct
13 Correct 189 ms 1880 KB Output is correct
14 Correct 190 ms 1884 KB Output is correct
15 Correct 413 ms 1880 KB Output is correct
16 Correct 422 ms 2072 KB Output is correct
17 Correct 403 ms 1884 KB Output is correct
18 Correct 7 ms 1880 KB Output is correct
19 Correct 7 ms 1884 KB Output is correct
20 Correct 38 ms 1884 KB Output is correct
21 Correct 38 ms 1884 KB Output is correct
22 Correct 76 ms 1884 KB Output is correct
23 Correct 79 ms 1884 KB Output is correct
24 Correct 112 ms 1880 KB Output is correct
25 Correct 104 ms 1884 KB Output is correct
26 Correct 5 ms 1884 KB Output is correct
27 Correct 5 ms 1884 KB Output is correct
28 Correct 319 ms 1996 KB Output is correct
29 Correct 376 ms 1884 KB Output is correct
30 Correct 771 ms 2140 KB Output is correct
31 Correct 819 ms 2136 KB Output is correct
32 Correct 827 ms 2136 KB Output is correct
33 Correct 842 ms 2136 KB Output is correct
34 Correct 2 ms 1884 KB Output is correct
35 Correct 34 ms 1884 KB Output is correct
36 Correct 167 ms 1884 KB Output is correct
37 Correct 418 ms 1884 KB Output is correct
38 Correct 833 ms 2140 KB Output is correct
39 Correct 829 ms 2120 KB Output is correct
40 Correct 212 ms 1884 KB Output is correct
41 Correct 429 ms 1880 KB Output is correct
42 Correct 654 ms 2376 KB Output is correct
43 Correct 856 ms 2392 KB Output is correct
44 Correct 830 ms 2136 KB Output is correct
45 Correct 823 ms 2136 KB Output is correct
46 Correct 413 ms 1880 KB Output is correct
47 Correct 622 ms 2140 KB Output is correct
48 Correct 617 ms 2124 KB Output is correct