oj.uz

Submission #469680

# Submission time Handle Problem Language Result Execution time Memory
469680 2021-09-01T15:16:54 Z Vladth11 Cloud Computing (CEOI18_clo) C++14
100 / 100
 591 ms 2044 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
#pragma GCC optimize("Ofast,unroll-loops")

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair <ll, ll> pii;
typedef pair <long double, pii> muchie;
typedef tree <ll, null_type, less_equal <ll>, rb_tree_tag, tree_order_statistics_node_update> OST;

const ll NMAX = 2001;
const ll VMAX = 100001;
const ll INF = (1LL << 60);
const ll HALF = (1LL << 59);
const ll MOD = 30013;
const ll BLOCK = 318;
const ll base = 31;
const ll nr_of_bits = 21;

ll n, m;
ll dp[2][VMAX];

struct ura{
    ll f, c, v;
}v[NMAX * 2];

bool cmp(ura a, ura b){
    if(a.f != b.f)
    return a.f > b.f;
    return a.v < b.v;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    ll i, j;
    cin >> n;
    for(i = 1; i <= n; i++){
        cin >> v[i].c >> v[i].f >> v[i].v;
        v[i].v = -v[i].v;
    }
    cin >> m;
    for(i = 1; i <= m; i++){
        cin >> v[n + i].c >> v[n + i].f >> v[n + i].v;
    }
    n += m;
    sort(v + 1, v + n + 1, cmp);
    for(i = 0; i <= n; i++){
        for(j = 0; j < VMAX; j++){
            dp[i][j] = -HALF;
        }
    }
    dp[0][0] = 0;
    for(i = 1; i <= n; i++){
        int act = i % 2;
        int last = (i - 1) % 2;
        for(ll cores = 0; cores < VMAX; cores++){
            dp[act][cores] = dp[last][cores];
        }
        if(v[i].v < 0){
            ll val = -v[i].v;
            for(ll cores = 0; cores < VMAX - v[i].c; cores++){
                dp[act][cores + v[i].c] = max(dp[act][cores + v[i].c], dp[last][cores] - val);
            }
        }else{
            for(ll cores = v[i].c; cores < VMAX; cores++){
                dp[act][cores - v[i].c] = max(dp[act][cores - v[i].c], dp[last][cores] + v[i].v);
            }
        }
    }
    ll maxim = 0;
    for(i = 0; i < VMAX; i++){
        maxim = max(maxim, dp[n % 2][i]);
    }
    cout << maxim;
    return 0;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1868 KB Output is correct
2 Correct 2 ms 1868 KB Output is correct
3 Correct 17 ms 1876 KB Output is correct
4 Correct 31 ms 1868 KB Output is correct
5 Correct 275 ms 1988 KB Output is correct
6 Correct 313 ms 1868 KB Output is correct
7 Correct 288 ms 1964 KB Output is correct
8 Correct 323 ms 1868 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1868 KB Output is correct
2 Correct 3 ms 1868 KB Output is correct
3 Correct 16 ms 1876 KB Output is correct
4 Correct 16 ms 1868 KB Output is correct
5 Correct 139 ms 1900 KB Output is correct
6 Correct 132 ms 1904 KB Output is correct
7 Correct 291 ms 1868 KB Output is correct
8 Correct 291 ms 1964 KB Output is correct
9 Correct 279 ms 1924 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1868 KB Output is correct
2 Correct 6 ms 1880 KB Output is correct
3 Correct 33 ms 1868 KB Output is correct
4 Correct 28 ms 1868 KB Output is correct
5 Correct 55 ms 1880 KB Output is correct
6 Correct 57 ms 1876 KB Output is correct
7 Correct 74 ms 1868 KB Output is correct
8 Correct 74 ms 1888 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1868 KB Output is correct
2 Correct 4 ms 1868 KB Output is correct
3 Correct 215 ms 1868 KB Output is correct
4 Correct 276 ms 1928 KB Output is correct
5 Correct 539 ms 2020 KB Output is correct
6 Correct 578 ms 1996 KB Output is correct
7 Correct 570 ms 2000 KB Output is correct
8 Correct 573 ms 1996 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1868 KB Output is correct
2 Correct 25 ms 1868 KB Output is correct
3 Correct 118 ms 1892 KB Output is correct
4 Correct 337 ms 1952 KB Output is correct
5 Correct 566 ms 2016 KB Output is correct
6 Correct 591 ms 1996 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1868 KB Output is correct
2 Correct 2 ms 1868 KB Output is correct
3 Correct 17 ms 1876 KB Output is correct
4 Correct 31 ms 1868 KB Output is correct
5 Correct 275 ms 1988 KB Output is correct
6 Correct 313 ms 1868 KB Output is correct
7 Correct 288 ms 1964 KB Output is correct
8 Correct 323 ms 1868 KB Output is correct
9 Correct 2 ms 1868 KB Output is correct
10 Correct 3 ms 1868 KB Output is correct
11 Correct 16 ms 1876 KB Output is correct
12 Correct 16 ms 1868 KB Output is correct
13 Correct 139 ms 1900 KB Output is correct
14 Correct 132 ms 1904 KB Output is correct
15 Correct 291 ms 1868 KB Output is correct
16 Correct 291 ms 1964 KB Output is correct
17 Correct 279 ms 1924 KB Output is correct
18 Correct 6 ms 1868 KB Output is correct
19 Correct 6 ms 1880 KB Output is correct
20 Correct 33 ms 1868 KB Output is correct
21 Correct 28 ms 1868 KB Output is correct
22 Correct 55 ms 1880 KB Output is correct
23 Correct 57 ms 1876 KB Output is correct
24 Correct 74 ms 1868 KB Output is correct
25 Correct 74 ms 1888 KB Output is correct
26 Correct 4 ms 1868 KB Output is correct
27 Correct 4 ms 1868 KB Output is correct
28 Correct 215 ms 1868 KB Output is correct
29 Correct 276 ms 1928 KB Output is correct
30 Correct 539 ms 2020 KB Output is correct
31 Correct 578 ms 1996 KB Output is correct
32 Correct 570 ms 2000 KB Output is correct
33 Correct 573 ms 1996 KB Output is correct
34 Correct 3 ms 1868 KB Output is correct
35 Correct 25 ms 1868 KB Output is correct
36 Correct 118 ms 1892 KB Output is correct
37 Correct 337 ms 1952 KB Output is correct
38 Correct 566 ms 2016 KB Output is correct
39 Correct 591 ms 1996 KB Output is correct
40 Correct 149 ms 1904 KB Output is correct
41 Correct 325 ms 1936 KB Output is correct
42 Correct 434 ms 1988 KB Output is correct
43 Correct 585 ms 2000 KB Output is correct
44 Correct 565 ms 2008 KB Output is correct
45 Correct 566 ms 2044 KB Output is correct
46 Correct 284 ms 1936 KB Output is correct
47 Correct 433 ms 1976 KB Output is correct
48 Correct 418 ms 1868 KB Output is correct