oj.uz

답안 #917282

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
917282 2024-01-27T15:46:25 Z ThommyDB Cloud Computing (CEOI18_clo) C++17
100 / 100
 1162 ms 3924 KB 
#include<bits/stdc++.h>

using namespace std;
#define int long long

struct ComputersAndOrders{
    int cores;
    int clockSpeed;
    int price;
};

int n, m;
vector<ComputersAndOrders> computersAndOrders;

bool decreaseF(const ComputersAndOrders a, const ComputersAndOrders b){
    if(a.clockSpeed == b.clockSpeed){
        if(a.price==b.price){
            return a.price > b.price;
        }
        return a.cores > b.cores;
    }
    return a.clockSpeed > b.clockSpeed;
}

int DP(){
    vector<int> memo(1e5*2, -1e15);
    vector<int> mem;
    memo[0]=0;
    mem.assign(memo.begin(), memo.end());

    for(int i = 0; i < n+m; i++){
        for(int j = 0; j < 1e5*2; j++){
            if(memo[j] > -1e15 && j+computersAndOrders[i].cores>=0){
                mem[j+computersAndOrders[i].cores] = max(memo[j+computersAndOrders[i].cores], memo[j]+computersAndOrders[i].price);
            }
        }

        memo.clear();
        memo.assign(mem.begin(), mem.end());
    }

    int ans = 0;
    for(int i = 0; i < 1e5*2; i++){
        ans = max(ans, memo[i]);
    }

    return ans;
}

signed main(){
    cin >> n;
    computersAndOrders.resize(n);
    int c, f, v;
    for(int i = 0; i <n; i++){
        cin >> c >> f >> v;
        computersAndOrders[i].cores = c;
        computersAndOrders[i].clockSpeed = f;
        computersAndOrders[i].price = -v;
    }
    cin >> m;
    computersAndOrders.resize(n+m);
    for(int i = 0; i < m; i++){
        cin >> c >> f >> v;
        computersAndOrders[i+n].cores = -c;
        computersAndOrders[i+n].clockSpeed = f;
        computersAndOrders[i+n].price = v;
    }
    sort(computersAndOrders.begin(), computersAndOrders.end(), decreaseF);

    cout << DP() << "\n";
}

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3416 KB Output is correct
2 Correct 2 ms 3420 KB Output is correct
3 Correct 29 ms 3420 KB Output is correct
4 Correct 60 ms 3560 KB Output is correct
5 Correct 467 ms 3416 KB Output is correct
6 Correct 473 ms 3616 KB Output is correct
7 Correct 506 ms 3416 KB Output is correct
8 Correct 472 ms 3420 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3420 KB Output is correct
2 Correct 4 ms 3384 KB Output is correct
3 Correct 28 ms 3584 KB Output is correct
4 Correct 28 ms 3420 KB Output is correct
5 Correct 233 ms 3608 KB Output is correct
6 Correct 221 ms 3672 KB Output is correct
7 Correct 528 ms 3676 KB Output is correct
8 Correct 475 ms 3672 KB Output is correct
9 Correct 558 ms 3648 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 3420 KB Output is correct
2 Correct 9 ms 3420 KB Output is correct
3 Correct 46 ms 3420 KB Output is correct
4 Correct 47 ms 3420 KB Output is correct
5 Correct 93 ms 3572 KB Output is correct
6 Correct 105 ms 3416 KB Output is correct
7 Correct 121 ms 3416 KB Output is correct
8 Correct 127 ms 3420 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 3416 KB Output is correct
2 Correct 7 ms 3420 KB Output is correct
3 Correct 359 ms 3632 KB Output is correct
4 Correct 440 ms 3596 KB Output is correct
5 Correct 971 ms 3924 KB Output is correct
6 Correct 1094 ms 3692 KB Output is correct
7 Correct 1162 ms 3696 KB Output is correct
8 Correct 1089 ms 3688 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3416 KB Output is correct
2 Correct 41 ms 3416 KB Output is correct
3 Correct 236 ms 3588 KB Output is correct
4 Correct 496 ms 3620 KB Output is correct
5 Correct 1089 ms 3688 KB Output is correct
6 Correct 1110 ms 3696 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3416 KB Output is correct
2 Correct 2 ms 3420 KB Output is correct
3 Correct 29 ms 3420 KB Output is correct
4 Correct 60 ms 3560 KB Output is correct
5 Correct 467 ms 3416 KB Output is correct
6 Correct 473 ms 3616 KB Output is correct
7 Correct 506 ms 3416 KB Output is correct
8 Correct 472 ms 3420 KB Output is correct
9 Correct 3 ms 3420 KB Output is correct
10 Correct 4 ms 3384 KB Output is correct
11 Correct 28 ms 3584 KB Output is correct
12 Correct 28 ms 3420 KB Output is correct
13 Correct 233 ms 3608 KB Output is correct
14 Correct 221 ms 3672 KB Output is correct
15 Correct 528 ms 3676 KB Output is correct
16 Correct 475 ms 3672 KB Output is correct
17 Correct 558 ms 3648 KB Output is correct
18 Correct 9 ms 3420 KB Output is correct
19 Correct 9 ms 3420 KB Output is correct
20 Correct 46 ms 3420 KB Output is correct
21 Correct 47 ms 3420 KB Output is correct
22 Correct 93 ms 3572 KB Output is correct
23 Correct 105 ms 3416 KB Output is correct
24 Correct 121 ms 3416 KB Output is correct
25 Correct 127 ms 3420 KB Output is correct
26 Correct 6 ms 3416 KB Output is correct
27 Correct 7 ms 3420 KB Output is correct
28 Correct 359 ms 3632 KB Output is correct
29 Correct 440 ms 3596 KB Output is correct
30 Correct 971 ms 3924 KB Output is correct
31 Correct 1094 ms 3692 KB Output is correct
32 Correct 1162 ms 3696 KB Output is correct
33 Correct 1089 ms 3688 KB Output is correct
34 Correct 3 ms 3416 KB Output is correct
35 Correct 41 ms 3416 KB Output is correct
36 Correct 236 ms 3588 KB Output is correct
37 Correct 496 ms 3620 KB Output is correct
38 Correct 1089 ms 3688 KB Output is correct
39 Correct 1110 ms 3696 KB Output is correct
40 Correct 258 ms 3420 KB Output is correct
41 Correct 472 ms 3620 KB Output is correct
42 Correct 701 ms 3676 KB Output is correct
43 Correct 1027 ms 3696 KB Output is correct
44 Correct 1026 ms 3752 KB Output is correct
45 Correct 993 ms 3788 KB Output is correct
46 Correct 471 ms 3644 KB Output is correct
47 Correct 706 ms 3704 KB Output is correct
48 Correct 712 ms 3696 KB Output is correct