oj.uz

Submission #550113

# Submission time Handle Problem Language Result Execution time Memory
550113 2022-04-17T09:43:55 Z Jomnoi Cloud Computing (CEOI18_clo) C++17
100 / 100
 419 ms 1312 KB 
#include <bits/stdc++.h>
#define DEBUG false
using namespace std;

const int MAX_C = 1e5 + 10;
const long long INF = 1e18 + 7;

long long dp[MAX_C + 1];

class Computer {
public :
    int c, f, v, t;
    Computer() {}
    Computer(const int &c_, const int &f_, const int &v_, const int &t_) : c(c_), f(f_), v(v_), t(t_) {}

    bool operator<(const Computer &o) const {
        return make_pair(f, -t) > make_pair(o.f, -o.t);
    }
};

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    cin >> n;
    vector <Computer> vec;
    for(int i = 1; i <= n; i++) {
        int c, f, v;
        cin >> c >> f >> v;
        vec.push_back(Computer(c, f, v, -1));
    }

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

    sort(vec.begin(), vec.end());

    for(int i = 0; i <= MAX_C; i++) {
        dp[i] = -INF;
    }
    dp[0] = 0;
    for(auto [c, f, v, t] : vec) {
        if(t == -1) {
            for(int C = MAX_C; C >= c; C--) {
                dp[C] = max(dp[C], dp[C - c] - v);
            }
        }
        else {
            for(int C = 0; C <= MAX_C - c; C++) {
                dp[C] = max(dp[C], dp[C + c] + v);
            }
        }
    }

    long long ans = 0;
    for(int i = 0; i <= MAX_C; i++) {
        ans = max(ans, dp[i]);
    }
    cout << ans;
    return 0;
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 13 ms 980 KB Output is correct
4 Correct 19 ms 1112 KB Output is correct
5 Correct 172 ms 1108 KB Output is correct
6 Correct 169 ms 1148 KB Output is correct
7 Correct 166 ms 1108 KB Output is correct
8 Correct 172 ms 1152 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 2 ms 980 KB Output is correct
3 Correct 10 ms 1108 KB Output is correct
4 Correct 10 ms 1108 KB Output is correct
5 Correct 87 ms 1136 KB Output is correct
6 Correct 81 ms 1108 KB Output is correct
7 Correct 179 ms 1152 KB Output is correct
8 Correct 190 ms 1148 KB Output is correct
9 Correct 168 ms 1148 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1108 KB Output is correct
2 Correct 4 ms 1108 KB Output is correct
3 Correct 16 ms 1116 KB Output is correct
4 Correct 17 ms 1120 KB Output is correct
5 Correct 35 ms 1108 KB Output is correct
6 Correct 32 ms 1108 KB Output is correct
7 Correct 45 ms 1112 KB Output is correct
8 Correct 42 ms 1108 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 980 KB Output is correct
2 Correct 2 ms 980 KB Output is correct
3 Correct 137 ms 1148 KB Output is correct
4 Correct 169 ms 1148 KB Output is correct
5 Correct 332 ms 1236 KB Output is correct
6 Correct 344 ms 1264 KB Output is correct
7 Correct 357 ms 1264 KB Output is correct
8 Correct 348 ms 1256 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 980 KB Output is correct
2 Correct 21 ms 1112 KB Output is correct
3 Correct 77 ms 1108 KB Output is correct
4 Correct 166 ms 1148 KB Output is correct
5 Correct 419 ms 1228 KB Output is correct
6 Correct 339 ms 1212 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct
3 Correct 13 ms 980 KB Output is correct
4 Correct 19 ms 1112 KB Output is correct
5 Correct 172 ms 1108 KB Output is correct
6 Correct 169 ms 1148 KB Output is correct
7 Correct 166 ms 1108 KB Output is correct
8 Correct 172 ms 1152 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 2 ms 980 KB Output is correct
11 Correct 10 ms 1108 KB Output is correct
12 Correct 10 ms 1108 KB Output is correct
13 Correct 87 ms 1136 KB Output is correct
14 Correct 81 ms 1108 KB Output is correct
15 Correct 179 ms 1152 KB Output is correct
16 Correct 190 ms 1148 KB Output is correct
17 Correct 168 ms 1148 KB Output is correct
18 Correct 3 ms 1108 KB Output is correct
19 Correct 4 ms 1108 KB Output is correct
20 Correct 16 ms 1116 KB Output is correct
21 Correct 17 ms 1120 KB Output is correct
22 Correct 35 ms 1108 KB Output is correct
23 Correct 32 ms 1108 KB Output is correct
24 Correct 45 ms 1112 KB Output is correct
25 Correct 42 ms 1108 KB Output is correct
26 Correct 2 ms 980 KB Output is correct
27 Correct 2 ms 980 KB Output is correct
28 Correct 137 ms 1148 KB Output is correct
29 Correct 169 ms 1148 KB Output is correct
30 Correct 332 ms 1236 KB Output is correct
31 Correct 344 ms 1264 KB Output is correct
32 Correct 357 ms 1264 KB Output is correct
33 Correct 348 ms 1256 KB Output is correct
34 Correct 2 ms 980 KB Output is correct
35 Correct 21 ms 1112 KB Output is correct
36 Correct 77 ms 1108 KB Output is correct
37 Correct 166 ms 1148 KB Output is correct
38 Correct 419 ms 1228 KB Output is correct
39 Correct 339 ms 1212 KB Output is correct
40 Correct 94 ms 1108 KB Output is correct
41 Correct 180 ms 1108 KB Output is correct
42 Correct 266 ms 1252 KB Output is correct
43 Correct 336 ms 1268 KB Output is correct
44 Correct 397 ms 1288 KB Output is correct
45 Correct 347 ms 1312 KB Output is correct
46 Correct 186 ms 1184 KB Output is correct
47 Correct 262 ms 1252 KB Output is correct
48 Correct 256 ms 1248 KB Output is correct