oj.uz

Submission #500734

# Submission time Handle Problem Language Result Execution time Memory
500734 2022-01-01T03:47:10 Z sberens Cloud Computing (CEOI18_clo) C++17
100 / 100
 929 ms 1996 KB 
#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>

using namespace __gnu_pbds;
template<typename K> using hset = gp_hash_table<K, null_type>;
template<typename K, typename V> using hmap = gp_hash_table<K, V>;


using namespace std;

#define all(x) (x).begin(), (x).end()
#define pb push_back
#define eb emplace_back
#define smax(x, y) (x = max(x, y))
#define smin(x, y) (x = min(x, y))

#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i,0,a)
#define ROF(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i, a) ROF(i,0,a)


using ll = long long;
using ld = long double;

template<typename T>
using vv = vector<vector<T>>;

using vi = vector<int>;
using ii = array<int, 2>;
using vii = vector<ii>;
using vvi = vv<int>;

using vll = vector<ll>;
using l2 = array<ll, 2>;
using vl2 = vector<l2>;
using vvll = vv<ll>;

template<typename T>
using minq = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using maxq = priority_queue<T>;

template<typename T>
using oset = tree<T, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update>;

const ll M = 1000000007;
const ll infll = M * M;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    vector<tuple<int, int, int>> tx;
    F0R(_, n) {
        int c, f, v;
        cin >> c >> f >> v;
        tx.eb(f, c, -v);
    }
    int m;
    cin >> m;
    F0R(_, m) {
        int c, f, v;
        cin >> c >> f >> v;
        tx.eb(f, -c, v);
    }
    sort(all(tx), greater<>());
    // dp[t][c] -> max value you can get with c spare cores
    // dp[t][c] = max(dp[t-1][c], dp[t-1][c-c[t]]
    int C = 50 * n + 1;
    vll dp(C, -infll);
    dp[0] = 0;
    F0R(t, n + m) {
        vll ndp(C, -infll);
        auto [f, tc, v] = tx[t];
        F0R(c, C) {
            if (dp[c] == -infll) continue;
            smax(ndp[c], dp[c]);
            if (0 <= c + tc && c + tc < C) smax(ndp[c+tc], dp[c]+v);
        }
        dp = ndp;
    }
    cout << *max_element(all(dp)) << '\n';
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 3 ms 388 KB Output is correct
6 Correct 4 ms 320 KB Output is correct
7 Correct 4 ms 332 KB Output is correct
8 Correct 4 ms 332 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 79 ms 992 KB Output is correct
6 Correct 66 ms 1000 KB Output is correct
7 Correct 372 ms 1980 KB Output is correct
8 Correct 319 ms 1980 KB Output is correct
9 Correct 375 ms 1876 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 7 ms 460 KB Output is correct
6 Correct 7 ms 460 KB Output is correct
7 Correct 11 ms 460 KB Output is correct
8 Correct 10 ms 460 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 181 ms 1520 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 739 ms 1996 KB Output is correct
6 Correct 852 ms 1996 KB Output is correct
7 Correct 929 ms 1996 KB Output is correct
8 Correct 845 ms 1876 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 45 ms 748 KB Output is correct
4 Correct 130 ms 972 KB Output is correct
5 Correct 765 ms 1996 KB Output is correct
6 Correct 876 ms 1996 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 3 ms 388 KB Output is correct
6 Correct 4 ms 320 KB Output is correct
7 Correct 4 ms 332 KB Output is correct
8 Correct 4 ms 332 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 79 ms 992 KB Output is correct
14 Correct 66 ms 1000 KB Output is correct
15 Correct 372 ms 1980 KB Output is correct
16 Correct 319 ms 1980 KB Output is correct
17 Correct 375 ms 1876 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 7 ms 460 KB Output is correct
23 Correct 7 ms 460 KB Output is correct
24 Correct 11 ms 460 KB Output is correct
25 Correct 10 ms 460 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 181 ms 1520 KB Output is correct
29 Correct 3 ms 332 KB Output is correct
30 Correct 739 ms 1996 KB Output is correct
31 Correct 852 ms 1996 KB Output is correct
32 Correct 929 ms 1996 KB Output is correct
33 Correct 845 ms 1876 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 45 ms 748 KB Output is correct
37 Correct 130 ms 972 KB Output is correct
38 Correct 765 ms 1996 KB Output is correct
39 Correct 876 ms 1996 KB Output is correct
40 Correct 50 ms 704 KB Output is correct
41 Correct 141 ms 964 KB Output is correct
42 Correct 369 ms 1648 KB Output is correct
43 Correct 721 ms 1980 KB Output is correct
44 Correct 717 ms 1988 KB Output is correct
45 Correct 778 ms 1996 KB Output is correct
46 Correct 158 ms 1100 KB Output is correct
47 Correct 368 ms 1612 KB Output is correct
48 Correct 354 ms 1660 KB Output is correct