oj.uz

Submission #972884

# Submission time Handle Problem Language Result Execution time Memory
972884 2024-05-01T09:30:34 Z Gajowy Cloud Computing (CEOI18_clo) C++17
100 / 100
 1622 ms 2384 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;

#define fwd(i, a, n) for (int i = (a); i < (n); i ++)
#define rep(i, n) fwd(i, 0, n)
#define all(X) begin(X), end(X)
#define sz(X) ((int)X.size())
#define st first
#define nd second
#define vi vector<int>
#define pii pair<int, int>
#define ll long long
#define vll vector<long long>

#ifdef LOC
auto &operator<<(auto &out, pair<auto, auto> a) {
    return out << "(" << a.st << ", " << a.nd << ")";
}
auto &operator<<(auto &out, auto a) {
    out << "{";
    for (auto b : a)
        out << b << ", ";
    return out << "}";
}
void dump(auto... x) { ((cerr << x << ", "), ...) << '\n'; }
#define debug(x...) cerr << "[" #x "]: ", dump(x)
#else
#define debug(...) 0
#endif

const int maxN = 2000 + 10;
const int maxC = 100;
const ll inf = 1e18;

struct computer {
    int c, f, v;
    computer() {}
    computer(int c, int f, int v) : c(c), f(f), v(v) {}
};

struct order {
    int c, f, v;
    order() {}
    order(int c, int f, int v) : c(c), f(f), v(v) {}
};

computer comp[maxN];
order ord[maxN];

vector<vll> dp;

void fix(int cid, int m) {
    rep(i, m) {
        rep(j, maxC + 1) {
            if (dp[i][j] == -inf) continue;
            dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);
            if (ord[i + 1].c <= j && ord[i + 1].f <= comp[cid].f) {
                dp[i + 1][j - ord[i + 1].c] = max(
                    dp[i + 1][j - ord[i + 1].c],
                    dp[i][j] + ord[i + 1].v
                );
            }
        }
    }
}

void ext(int cid, int m) {
    rep(i, m + 1)
        for (int j = maxC; j >= 0; j --) {
            if (dp[i][j] == -inf) continue;
            int s = min(maxC, j + comp[cid].c);
            dp[i][s] = max(dp[i][s], dp[i][j] - comp[cid].v);
        }
}

int32_t main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    int n;
    cin >> n;
    for (int i = 1; i <= n; i ++) {
        int c, f, v;
        cin >> c >> f >> v;
        comp[i] = computer(c, f, v);
    }
    int m;
    cin >> m;
    for (int i = 1; i <= m; i ++) {
        int c, f, v;
        cin >> c >> f >> v;
        ord[i] = order(c, f, v);
    }
    sort(comp + 1, comp + n + 1, [&](auto &a, auto &b) {
        return a.f > b.f;
    });
    sort(ord + 1, ord + m + 1, [&](auto &a, auto &b) {
        return a.f > b.f;
    });
    dp.resize(m + 1, vll(maxC + 1, -inf));
    dp[0][0] = 0;
    for (int i = 1; i <= n; i ++) {
        ext(i, m);
        fix(i, m);
    }
    cout << *max_element(all(dp.back())) << '\n';
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 11 ms 2048 KB Output is correct
6 Correct 6 ms 2048 KB Output is correct
7 Correct 11 ms 1884 KB Output is correct
8 Correct 12 ms 1884 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 5 ms 348 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 11 ms 496 KB Output is correct
8 Correct 11 ms 492 KB Output is correct
9 Correct 11 ms 348 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 10 ms 348 KB Output is correct
6 Correct 10 ms 344 KB Output is correct
7 Correct 18 ms 604 KB Output is correct
8 Correct 18 ms 600 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 12 ms 1880 KB Output is correct
5 Correct 1426 ms 2128 KB Output is correct
6 Correct 1622 ms 2384 KB Output is correct
7 Correct 1566 ms 2140 KB Output is correct
8 Correct 1503 ms 2108 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 55 ms 656 KB Output is correct
4 Correct 356 ms 1620 KB Output is correct
5 Correct 1504 ms 2140 KB Output is correct
6 Correct 1548 ms 2140 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 11 ms 2048 KB Output is correct
6 Correct 6 ms 2048 KB Output is correct
7 Correct 11 ms 1884 KB Output is correct
8 Correct 12 ms 1884 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 5 ms 348 KB Output is correct
14 Correct 4 ms 348 KB Output is correct
15 Correct 11 ms 496 KB Output is correct
16 Correct 11 ms 492 KB Output is correct
17 Correct 11 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 3 ms 348 KB Output is correct
21 Correct 3 ms 344 KB Output is correct
22 Correct 10 ms 348 KB Output is correct
23 Correct 10 ms 344 KB Output is correct
24 Correct 18 ms 604 KB Output is correct
25 Correct 18 ms 600 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 4 ms 344 KB Output is correct
29 Correct 12 ms 1880 KB Output is correct
30 Correct 1426 ms 2128 KB Output is correct
31 Correct 1622 ms 2384 KB Output is correct
32 Correct 1566 ms 2140 KB Output is correct
33 Correct 1503 ms 2108 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 55 ms 656 KB Output is correct
37 Correct 356 ms 1620 KB Output is correct
38 Correct 1504 ms 2140 KB Output is correct
39 Correct 1548 ms 2140 KB Output is correct
40 Correct 96 ms 876 KB Output is correct
41 Correct 328 ms 1372 KB Output is correct
42 Correct 758 ms 1700 KB Output is correct
43 Correct 460 ms 2140 KB Output is correct
44 Correct 470 ms 2140 KB Output is correct
45 Correct 461 ms 2140 KB Output is correct
46 Correct 322 ms 1112 KB Output is correct
47 Correct 779 ms 1708 KB Output is correct
48 Correct 726 ms 1652 KB Output is correct