oj.uz

답안 #770715

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
770715 2023-07-01T19:05:18 Z treewave Cloud Computing (CEOI18_clo) C++17
100 / 100
 1129 ms 3728 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long
const int INF = 1e18;

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n; cin >> n;
    vector<array<int,3>> payments;
    for (int i = 0; i < n; i++){
        int cores, clock, price;
        cin >> cores >> clock >> price;
        payments.push_back({clock, cores, -price});
    }
    int m; cin >> m;
    vector<array<int,3>> customers;
    for (int i = 0; i < m; i++){
        int cores, clock, price;
        cin >> cores >> clock >> price;
        payments.push_back({clock, -cores, price});
    }
    sort(payments.begin(), payments.end());
    int maxCores = 1;
    for (int i = 0; i < n+m; i++){
        maxCores += abs(payments[i][1]);
    }
//    cerr << maxCores << "\n";
    vector<int> dp(maxCores, -INF), ndp(maxCores, -INF);
    dp[0] = 0;
    for (int i = n+m-1; i >= 0; i--){
        ndp = dp;
        for (int c = 0; c < maxCores; c++){
            if (0 <= c + payments[i][1] && c + payments[i][1] < maxCores){
                ndp[c + payments[i][1]] = max(ndp[c + payments[i][1]], dp[c] + payments[i][2]);
            }
        }
        swap(ndp, dp);
    }
    int ans = -INF;
    for (int i = 0; i < maxCores; i++){
        ans = max(ans, dp[i]);
    }
    cout << ans << "\n";
}

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 129 ms 1200 KB Output is correct
6 Correct 44 ms 708 KB Output is correct
7 Correct 272 ms 1876 KB Output is correct
8 Correct 252 ms 1876 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 29 ms 724 KB Output is correct
6 Correct 3 ms 336 KB Output is correct
7 Correct 147 ms 1280 KB Output is correct
8 Correct 28 ms 596 KB Output is correct
9 Correct 242 ms 1736 KB Output is correct

Subtask #3
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 212 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 340 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 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 11 ms 440 KB Output is correct
4 Correct 24 ms 468 KB Output is correct
5 Correct 509 ms 2052 KB Output is correct
6 Correct 1032 ms 3368 KB Output is correct
7 Correct 1012 ms 3376 KB Output is correct
8 Correct 956 ms 3308 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 28 ms 724 KB Output is correct
4 Correct 14 ms 448 KB Output is correct
5 Correct 978 ms 3296 KB Output is correct
6 Correct 1075 ms 3440 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 129 ms 1200 KB Output is correct
6 Correct 44 ms 708 KB Output is correct
7 Correct 272 ms 1876 KB Output is correct
8 Correct 252 ms 1876 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 29 ms 724 KB Output is correct
14 Correct 3 ms 336 KB Output is correct
15 Correct 147 ms 1280 KB Output is correct
16 Correct 28 ms 596 KB Output is correct
17 Correct 242 ms 1736 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 324 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 11 ms 440 KB Output is correct
29 Correct 24 ms 468 KB Output is correct
30 Correct 509 ms 2052 KB Output is correct
31 Correct 1032 ms 3368 KB Output is correct
32 Correct 1012 ms 3376 KB Output is correct
33 Correct 956 ms 3308 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 2 ms 340 KB Output is correct
36 Correct 28 ms 724 KB Output is correct
37 Correct 14 ms 448 KB Output is correct
38 Correct 978 ms 3296 KB Output is correct
39 Correct 1075 ms 3440 KB Output is correct
40 Correct 65 ms 1108 KB Output is correct
41 Correct 239 ms 1748 KB Output is correct
42 Correct 14 ms 528 KB Output is correct
43 Correct 1112 ms 3692 KB Output is correct
44 Correct 1111 ms 3720 KB Output is correct
45 Correct 1129 ms 3728 KB Output is correct
46 Correct 6 ms 340 KB Output is correct
47 Correct 13 ms 492 KB Output is correct
48 Correct 13 ms 464 KB Output is correct