oj.uz

Submission #361770

# Submission time Handle Problem Language Result Execution time Memory
361770 2021-01-31T15:02:31 Z arujbansal Cloud Computing (CEOI18_clo) C++17
100 / 100
 446 ms 1388 KB 
#include <bits/stdc++.h>

using namespace std;

void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail>
void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)

#define rng_init mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define all(x) (x).begin(), (x).end()
#define sz(x) (int) (x).size()
#define int long long

const int MXN = 1e5 + 5, INF = 1e18;

struct Computer {
    int cores, freq, price;

    Computer(int cores, int freq, int price) : cores(cores), freq(freq), price(price) {}

    bool operator<(const Computer &other) const {
        if (freq == other.freq) {
            return price < other.price;
        }

        return freq > other.freq;
    }
};

void solve() {
    int N;
    cin >> N;

    vector<Computer> computers;

    for (int i = 0; i < N; i++) {
        int cores, freq, price;
        cin >> cores >> freq >> price;
        computers.emplace_back(cores, freq, -price);
    }

    int M;
    cin >> M;

    for (int i = 0; i < M; i++) {
        int cores, freq, price;
        cin >> cores >> freq >> price;
        computers.emplace_back(cores, freq, price);
    }

    sort(all(computers));

    vector<int> dp(MXN, -INF);
    dp[0] = 0;

    for (int i = 0; i < sz(computers); i++) {
        if (computers[i].price < 0) {
            // This is a computer we have
            for (int j = MXN - 1; j >= computers[i].cores; j--) {
                dp[j] = max(dp[j], dp[j - computers[i].cores] + computers[i].price);
            }
        } else {
            // This is an order
            for (int j = 0; j < MXN; j++) {
                if (j + + computers[i].cores < MXN) {
                    dp[j] = max(dp[j], dp[j + computers[i].cores] + computers[i].price);
                }
            }
        }
    }

    cout << *max_element(all(dp));
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

#ifdef local
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    int TC = 1;
//    cin >> TC;
    while (TC--) solve();
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1132 KB Output is correct
2 Correct 1 ms 1132 KB Output is correct
3 Correct 12 ms 1132 KB Output is correct
4 Correct 23 ms 1132 KB Output is correct
5 Correct 227 ms 1260 KB Output is correct
6 Correct 205 ms 1260 KB Output is correct
7 Correct 231 ms 1260 KB Output is correct
8 Correct 221 ms 1260 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1136 KB Output is correct
2 Correct 3 ms 1132 KB Output is correct
3 Correct 13 ms 1132 KB Output is correct
4 Correct 14 ms 1132 KB Output is correct
5 Correct 108 ms 1132 KB Output is correct
6 Correct 97 ms 1132 KB Output is correct
7 Correct 225 ms 1260 KB Output is correct
8 Correct 219 ms 1260 KB Output is correct
9 Correct 207 ms 1260 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1132 KB Output is correct
2 Correct 4 ms 1132 KB Output is correct
3 Correct 20 ms 1132 KB Output is correct
4 Correct 20 ms 1132 KB Output is correct
5 Correct 39 ms 1132 KB Output is correct
6 Correct 43 ms 1132 KB Output is correct
7 Correct 59 ms 1132 KB Output is correct
8 Correct 54 ms 1132 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1132 KB Output is correct
2 Correct 3 ms 1132 KB Output is correct
3 Correct 161 ms 1260 KB Output is correct
4 Correct 201 ms 1260 KB Output is correct
5 Correct 404 ms 1388 KB Output is correct
6 Correct 436 ms 1388 KB Output is correct
7 Correct 430 ms 1388 KB Output is correct
8 Correct 446 ms 1388 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1132 KB Output is correct
2 Correct 18 ms 1132 KB Output is correct
3 Correct 94 ms 1132 KB Output is correct
4 Correct 215 ms 1260 KB Output is correct
5 Correct 427 ms 1388 KB Output is correct
6 Correct 424 ms 1388 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1132 KB Output is correct
2 Correct 1 ms 1132 KB Output is correct
3 Correct 12 ms 1132 KB Output is correct
4 Correct 23 ms 1132 KB Output is correct
5 Correct 227 ms 1260 KB Output is correct
6 Correct 205 ms 1260 KB Output is correct
7 Correct 231 ms 1260 KB Output is correct
8 Correct 221 ms 1260 KB Output is correct
9 Correct 2 ms 1136 KB Output is correct
10 Correct 3 ms 1132 KB Output is correct
11 Correct 13 ms 1132 KB Output is correct
12 Correct 14 ms 1132 KB Output is correct
13 Correct 108 ms 1132 KB Output is correct
14 Correct 97 ms 1132 KB Output is correct
15 Correct 225 ms 1260 KB Output is correct
16 Correct 219 ms 1260 KB Output is correct
17 Correct 207 ms 1260 KB Output is correct
18 Correct 4 ms 1132 KB Output is correct
19 Correct 4 ms 1132 KB Output is correct
20 Correct 20 ms 1132 KB Output is correct
21 Correct 20 ms 1132 KB Output is correct
22 Correct 39 ms 1132 KB Output is correct
23 Correct 43 ms 1132 KB Output is correct
24 Correct 59 ms 1132 KB Output is correct
25 Correct 54 ms 1132 KB Output is correct
26 Correct 3 ms 1132 KB Output is correct
27 Correct 3 ms 1132 KB Output is correct
28 Correct 161 ms 1260 KB Output is correct
29 Correct 201 ms 1260 KB Output is correct
30 Correct 404 ms 1388 KB Output is correct
31 Correct 436 ms 1388 KB Output is correct
32 Correct 430 ms 1388 KB Output is correct
33 Correct 446 ms 1388 KB Output is correct
34 Correct 2 ms 1132 KB Output is correct
35 Correct 18 ms 1132 KB Output is correct
36 Correct 94 ms 1132 KB Output is correct
37 Correct 215 ms 1260 KB Output is correct
38 Correct 427 ms 1388 KB Output is correct
39 Correct 424 ms 1388 KB Output is correct
40 Correct 111 ms 1132 KB Output is correct
41 Correct 205 ms 1260 KB Output is correct
42 Correct 353 ms 1388 KB Output is correct
43 Correct 441 ms 1388 KB Output is correct
44 Correct 435 ms 1388 KB Output is correct
45 Correct 427 ms 1388 KB Output is correct
46 Correct 211 ms 1260 KB Output is correct
47 Correct 320 ms 1388 KB Output is correct
48 Correct 351 ms 1388 KB Output is correct