oj.uz

Submission #597269

# Submission time Handle Problem Language Result Execution time Memory
597269 2022-07-15T20:16:41 Z leroycut Cloud Computing (CEOI18_clo) C++17
100 / 100
 508 ms 2124 KB 
#include <bits/stdc++.h>
 
using namespace std;
using ll = long long;
using ld = long double;
 
const ll N = 100003, mod = 1e9 + 7, inf = 1e18 + 7;

struct node
{
    int core, rate;
    ll cost;
}t;

bool cnt(node a, node b){
    if(a.rate == b.rate) return a.cost < b.cost;
    return a.rate > b.rate;
}

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

    int n, m;
    cin >> n;
    vector<node> v;

    for(int i = 0; i < n; ++i){
        cin >> t.core >> t.rate >> t.cost;
        t.cost = -t.cost;
        v.push_back(t);
    }

    cin >> m;

    for(int i = 0; i < m; ++i){
        cin >> t.core >> t.rate >> t.cost;
        t.core = -t.core;
        v.push_back(t);
    }

    sort(v.begin(), v.end(), cnt);

    // for(int i = 0; i < v.size(); ++i) cout << v[i].cost << "\n";

    vector<ll> last, dp(N, -inf);
    dp[0] = 0;

    for(auto i : v){
        last = dp;
        for(int c = 0; c < N; ++c){
            if(0 <= c - i.core && c - i.core < N && last[c - i.core] != -inf){
                dp[c] = max(dp[c], last[c - i.core] + i.cost);
            }
        }
    }
    
    ll ans = 0;
    for(int i = 0; i < N; ++i){
        ans = max(ans, dp[i]);
    }
    cout << ans;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 2 ms 1856 KB Output is correct
3 Correct 12 ms 1856 KB Output is correct
4 Correct 22 ms 1876 KB Output is correct
5 Correct 194 ms 1984 KB Output is correct
6 Correct 176 ms 1980 KB Output is correct
7 Correct 181 ms 2004 KB Output is correct
8 Correct 193 ms 2004 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1876 KB Output is correct
2 Correct 2 ms 1876 KB Output is correct
3 Correct 11 ms 1876 KB Output is correct
4 Correct 10 ms 1876 KB Output is correct
5 Correct 100 ms 1932 KB Output is correct
6 Correct 88 ms 1936 KB Output is correct
7 Correct 221 ms 2004 KB Output is correct
8 Correct 192 ms 2004 KB Output is correct
9 Correct 214 ms 1980 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1876 KB Output is correct
2 Correct 4 ms 1876 KB Output is correct
3 Correct 19 ms 1876 KB Output is correct
4 Correct 21 ms 1876 KB Output is correct
5 Correct 33 ms 1888 KB Output is correct
6 Correct 41 ms 1876 KB Output is correct
7 Correct 48 ms 1876 KB Output is correct
8 Correct 56 ms 1908 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1876 KB Output is correct
2 Correct 3 ms 1876 KB Output is correct
3 Correct 145 ms 1952 KB Output is correct
4 Correct 178 ms 1964 KB Output is correct
5 Correct 398 ms 2124 KB Output is correct
6 Correct 480 ms 2004 KB Output is correct
7 Correct 506 ms 2060 KB Output is correct
8 Correct 470 ms 2052 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1876 KB Output is correct
2 Correct 21 ms 1876 KB Output is correct
3 Correct 90 ms 1920 KB Output is correct
4 Correct 198 ms 1876 KB Output is correct
5 Correct 436 ms 2004 KB Output is correct
6 Correct 466 ms 2040 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 2 ms 1856 KB Output is correct
3 Correct 12 ms 1856 KB Output is correct
4 Correct 22 ms 1876 KB Output is correct
5 Correct 194 ms 1984 KB Output is correct
6 Correct 176 ms 1980 KB Output is correct
7 Correct 181 ms 2004 KB Output is correct
8 Correct 193 ms 2004 KB Output is correct
9 Correct 2 ms 1876 KB Output is correct
10 Correct 2 ms 1876 KB Output is correct
11 Correct 11 ms 1876 KB Output is correct
12 Correct 10 ms 1876 KB Output is correct
13 Correct 100 ms 1932 KB Output is correct
14 Correct 88 ms 1936 KB Output is correct
15 Correct 221 ms 2004 KB Output is correct
16 Correct 192 ms 2004 KB Output is correct
17 Correct 214 ms 1980 KB Output is correct
18 Correct 4 ms 1876 KB Output is correct
19 Correct 4 ms 1876 KB Output is correct
20 Correct 19 ms 1876 KB Output is correct
21 Correct 21 ms 1876 KB Output is correct
22 Correct 33 ms 1888 KB Output is correct
23 Correct 41 ms 1876 KB Output is correct
24 Correct 48 ms 1876 KB Output is correct
25 Correct 56 ms 1908 KB Output is correct
26 Correct 3 ms 1876 KB Output is correct
27 Correct 3 ms 1876 KB Output is correct
28 Correct 145 ms 1952 KB Output is correct
29 Correct 178 ms 1964 KB Output is correct
30 Correct 398 ms 2124 KB Output is correct
31 Correct 480 ms 2004 KB Output is correct
32 Correct 506 ms 2060 KB Output is correct
33 Correct 470 ms 2052 KB Output is correct
34 Correct 2 ms 1876 KB Output is correct
35 Correct 21 ms 1876 KB Output is correct
36 Correct 90 ms 1920 KB Output is correct
37 Correct 198 ms 1876 KB Output is correct
38 Correct 436 ms 2004 KB Output is correct
39 Correct 466 ms 2040 KB Output is correct
40 Correct 122 ms 1876 KB Output is correct
41 Correct 189 ms 1984 KB Output is correct
42 Correct 270 ms 2004 KB Output is correct
43 Correct 466 ms 2056 KB Output is correct
44 Correct 508 ms 2004 KB Output is correct
45 Correct 425 ms 2096 KB Output is correct
46 Correct 217 ms 1876 KB Output is correct
47 Correct 271 ms 2004 KB Output is correct
48 Correct 264 ms 2004 KB Output is correct