oj.uz

답안 #678910

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
678910 2023-01-06T22:17:03 Z bebra Cloud Computing (CEOI18_clo) C++17
100 / 100
 902 ms 2772 KB 
#include <bits/stdc++.h>
using namespace std;


struct Computer {
    int cores_n;
    int freq;
    int price;
    int type;

    Computer(int _cores_n = 0, int _freq = 0, int _price = 0, int _type = -1)
        : cores_n(_cores_n), freq(_freq), price(_price), type(_type) {}

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

    friend istream& operator>>(istream& is, Computer& obj) {
        is >> obj.cores_n >> obj.freq >> obj.price;
        return is;
    }
    friend ostream& operator<<(ostream& os, const Computer& obj) {
        os << obj.type << ' ' << obj.cores_n << ' ' << obj.freq << ' ' << obj.price;
        return os;
    }
};


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vector<Computer> a;
    a.reserve(n * 4);
    int sum = 0;
    for (int i = 0; i < n; ++i) {
        Computer comp;
        cin >> comp;
        comp.type = 1;
        a.push_back(comp);
        sum += comp.cores_n;
    }
    int m;
    cin >> m;
    for (int i = 0; i < m; ++i) {
        Computer comp;
        cin >> comp;
        comp.type = 2;
        a.push_back(comp);
    }
    sort(a.rbegin(), a.rend());
    const int MAX_K = sum;
    const long long MINUS_INF = (long long)(-1e13);
    vector<vector<long long>> dp(2, vector<long long>(MAX_K + 1, MINUS_INF));
    dp[0][0] = 0;
    for (int i = 1; i <= n + m; ++i) {
        for (int j = 0; j <= MAX_K; ++j) {
            dp[i & 1][j] = MINUS_INF;
            if (a[i - 1].type == 1) {
                dp[i & 1][j] = max(dp[i & 1][j], dp[(i - 1) & 1][j]);
                if (j - a[i - 1].cores_n >= 0) {
                    dp[i & 1][j] = max(dp[i & 1][j], dp[(i - 1) & 1][j - a[i - 1].cores_n] - a[i - 1].price);
                }
            } else if (a[i - 1].type == 2) {
                dp[i & 1][j] = max(dp[i & 1][j], dp[(i - 1) & 1][j]);
                if (j + a[i - 1].cores_n <= MAX_K) {
                    dp[i & 1][j] = max(dp[i & 1][j], dp[(i - 1) & 1][j + a[i - 1].cores_n] + a[i - 1].price);
                }
            }
        }
    }
    long long ans = 0;
    for (int j = 0; j <= MAX_K; ++j) {
        ans = max(ans, dp[(n + m) & 1][j]);
    }
    cout << ans << '\n';
    
    return 0;
}

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 5 ms 340 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 9 ms 460 KB Output is correct
8 Correct 8 ms 460 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 55 ms 852 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 299 ms 1620 KB Output is correct
8 Correct 42 ms 596 KB Output is correct
9 Correct 397 ms 2388 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 21 ms 468 KB Output is correct
4 Correct 3 ms 328 KB Output is correct
5 Correct 484 ms 1620 KB Output is correct
6 Correct 902 ms 2516 KB Output is correct
7 Correct 793 ms 2516 KB Output is correct
8 Correct 727 ms 2388 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 63 ms 852 KB Output is correct
4 Correct 10 ms 352 KB Output is correct
5 Correct 774 ms 2504 KB Output is correct
6 Correct 846 ms 2504 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 5 ms 340 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 9 ms 460 KB Output is correct
8 Correct 8 ms 460 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 55 ms 852 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 299 ms 1620 KB Output is correct
16 Correct 42 ms 596 KB Output is correct
17 Correct 397 ms 2388 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 320 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 320 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 21 ms 468 KB Output is correct
29 Correct 3 ms 328 KB Output is correct
30 Correct 484 ms 1620 KB Output is correct
31 Correct 902 ms 2516 KB Output is correct
32 Correct 793 ms 2516 KB Output is correct
33 Correct 727 ms 2388 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 63 ms 852 KB Output is correct
37 Correct 10 ms 352 KB Output is correct
38 Correct 774 ms 2504 KB Output is correct
39 Correct 846 ms 2504 KB Output is correct
40 Correct 51 ms 852 KB Output is correct
41 Correct 157 ms 1108 KB Output is correct
42 Correct 12 ms 448 KB Output is correct
43 Correct 880 ms 2764 KB Output is correct
44 Correct 870 ms 2772 KB Output is correct
45 Correct 843 ms 2772 KB Output is correct
46 Correct 7 ms 340 KB Output is correct
47 Correct 12 ms 380 KB Output is correct
48 Correct 11 ms 340 KB Output is correct