oj.uz

Submission #462428

# Submission time Handle Problem Language Result Execution time Memory
462428 2021-08-10T13:51:41 Z idk321 Cloud Computing (CEOI18_clo) C++17
100 / 100
 455 ms 1276 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;


/*
ll tryAll(int i, vector<array<int, 3>>& comps, vector<int> cores, ll cost) {
    if (i == comps.size()) {
        return solveFor(cur, cost);
    }

    ll best = tryAll(i + 1, comps, cores, cost);
    for (int j = 0; j < comps[i][0]; i++) cores.push(comps[1]);
    cost += comps[i][2];
    best = max(best, cost);
    return best;
}

ll solveFor(vector<int> cores, ll cost) {
    ll sum = 0;

    return sum - cost;
}
*/

bool comp(const array<int, 4>& ar1, const array<int, 4>& ar2) {
    if (ar1[1] == ar2[1]) {
        if (ar1[3] == ar2[3]) return false;
        if (ar1[3] == 0) return true;
        return false;
    }
    return (ar1[1] > ar2[1]);
}

const int N = 102000;
const ll MIN = -2000000000000000000LL;
ll resAt[N];

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;

    vector<array<int, 4>> all;

    for (int i = 0; i < n; i++) {
        int c, f, v;
        cin >> c >> f >> v;
        all.push_back({c, f, v, 0});
    }

    for (int i = 0; i < N; i++) resAt[i] = MIN;

    int m;
    cin >> m;
    for (int i = 0; i < m; i++) {
        int c, f, v;
        cin >> c >> f >> v;
        all.push_back({c, f, v, 1});
    }

    resAt[0] = 0;
    sort(all.begin(), all.end(), comp);
    for (int i = 0; i < all.size(); i++) {

        if (all[i][3] == 0) {
            for (int j = N - 1 - all[i][0];  j >= 0; j--) {
                resAt[j + all[i][0]] = max(resAt[j + all[i][0]], resAt[j] - all[i][2]);
            }
        } else {
            for (int j = all[i][0]; j <N; j++) {
                resAt[j - all[i][0]] = max(resAt[j - all[i][0]], resAt[j] + all[i][2]);
            }
        }
    }

    ll res = MIN;
    for (int i = 0; i < N; i++ ) {
        if (resAt[i] > res) {
            res = resAt[i];
        }
    }

    cout << res << "\n";
}

/*
4
4 2200 700
2 1800 10
20 2550 9999
4 2000 750
3
1 1500 300
6 1900 1500
3 2400 4550
*/

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:66:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 4> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     for (int i = 0; i < all.size(); i++) {
      |                     ~~^~~~~~~~~~~~

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 15 ms 1104 KB Output is correct
4 Correct 22 ms 1120 KB Output is correct
5 Correct 198 ms 1164 KB Output is correct
6 Correct 228 ms 1156 KB Output is correct
7 Correct 214 ms 1152 KB Output is correct
8 Correct 204 ms 1220 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1100 KB Output is correct
2 Correct 2 ms 1100 KB Output is correct
3 Correct 12 ms 1100 KB Output is correct
4 Correct 11 ms 1100 KB Output is correct
5 Correct 93 ms 1136 KB Output is correct
6 Correct 91 ms 1100 KB Output is correct
7 Correct 207 ms 1160 KB Output is correct
8 Correct 203 ms 1164 KB Output is correct
9 Correct 196 ms 1100 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1100 KB Output is correct
2 Correct 4 ms 1100 KB Output is correct
3 Correct 22 ms 1152 KB Output is correct
4 Correct 19 ms 1120 KB Output is correct
5 Correct 37 ms 1100 KB Output is correct
6 Correct 40 ms 1104 KB Output is correct
7 Correct 68 ms 1100 KB Output is correct
8 Correct 51 ms 1112 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1100 KB Output is correct
2 Correct 3 ms 1100 KB Output is correct
3 Correct 153 ms 1156 KB Output is correct
4 Correct 185 ms 1160 KB Output is correct
5 Correct 377 ms 1276 KB Output is correct
6 Correct 407 ms 1264 KB Output is correct
7 Correct 404 ms 1272 KB Output is correct
8 Correct 402 ms 1264 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1100 KB Output is correct
2 Correct 21 ms 1116 KB Output is correct
3 Correct 81 ms 1100 KB Output is correct
4 Correct 198 ms 1156 KB Output is correct
5 Correct 408 ms 1228 KB Output is correct
6 Correct 415 ms 1228 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 15 ms 1104 KB Output is correct
4 Correct 22 ms 1120 KB Output is correct
5 Correct 198 ms 1164 KB Output is correct
6 Correct 228 ms 1156 KB Output is correct
7 Correct 214 ms 1152 KB Output is correct
8 Correct 204 ms 1220 KB Output is correct
9 Correct 2 ms 1100 KB Output is correct
10 Correct 2 ms 1100 KB Output is correct
11 Correct 12 ms 1100 KB Output is correct
12 Correct 11 ms 1100 KB Output is correct
13 Correct 93 ms 1136 KB Output is correct
14 Correct 91 ms 1100 KB Output is correct
15 Correct 207 ms 1160 KB Output is correct
16 Correct 203 ms 1164 KB Output is correct
17 Correct 196 ms 1100 KB Output is correct
18 Correct 4 ms 1100 KB Output is correct
19 Correct 4 ms 1100 KB Output is correct
20 Correct 22 ms 1152 KB Output is correct
21 Correct 19 ms 1120 KB Output is correct
22 Correct 37 ms 1100 KB Output is correct
23 Correct 40 ms 1104 KB Output is correct
24 Correct 68 ms 1100 KB Output is correct
25 Correct 51 ms 1112 KB Output is correct
26 Correct 3 ms 1100 KB Output is correct
27 Correct 3 ms 1100 KB Output is correct
28 Correct 153 ms 1156 KB Output is correct
29 Correct 185 ms 1160 KB Output is correct
30 Correct 377 ms 1276 KB Output is correct
31 Correct 407 ms 1264 KB Output is correct
32 Correct 404 ms 1272 KB Output is correct
33 Correct 402 ms 1264 KB Output is correct
34 Correct 2 ms 1100 KB Output is correct
35 Correct 21 ms 1116 KB Output is correct
36 Correct 81 ms 1100 KB Output is correct
37 Correct 198 ms 1156 KB Output is correct
38 Correct 408 ms 1228 KB Output is correct
39 Correct 415 ms 1228 KB Output is correct
40 Correct 103 ms 1140 KB Output is correct
41 Correct 195 ms 1184 KB Output is correct
42 Correct 336 ms 1228 KB Output is correct
43 Correct 455 ms 1276 KB Output is correct
44 Correct 413 ms 1276 KB Output is correct
45 Correct 401 ms 1228 KB Output is correct
46 Correct 205 ms 1176 KB Output is correct
47 Correct 308 ms 1244 KB Output is correct
48 Correct 292 ms 1248 KB Output is correct