oj.uz

답안 #761667

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
761667 2023-06-20T06:58:50 Z vgoofficial Cloud Computing (CEOI18_clo) C++14
100 / 100
 783 ms 2104 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct Order {
    ll numCores, clockRate, money;
};
int main() {
    ios_base::sync_with_stdio(false); 
    cin.tie(0);
    int total=0;
    int n,m;
    cin >> n;
    vector<Order> shops;
    for(int i = 0; i < n; i++) {
        Order temp;
        cin >> temp.numCores >> temp.clockRate >> temp.money;
        temp.money=-temp.money;
        shops.push_back(temp);
        total+=temp.numCores;
    }
    cin >> m;
    for(int i = 0; i < m; i++) {
        Order temp;
        cin >> temp.numCores >> temp.clockRate >> temp.money;
        temp.numCores=-temp.numCores;
        shops.push_back(temp);
    }
    sort(shops.begin(), shops.end(), [](const Order &a, const Order &b) -> bool{
        return a.clockRate != b.clockRate ? a.clockRate > b.clockRate : a.money < b.money;
    });
    vector<ll> maxProfit(total+1, -1e14);
    maxProfit[0]=0;
    for(int i = 0; i < shops.size(); i++) {
        vector<ll> tempMaxProfit(maxProfit);
        for(int j = 0; j <= total; j++) {
            int prev = j - shops[i].numCores;
            if(prev>=0&&prev<=total&&maxProfit[prev]!=-1e14) {
                tempMaxProfit[j]=max(tempMaxProfit[j], maxProfit[prev]+shops[i].money);
            }
        }
        maxProfit=tempMaxProfit;
    }
    cout << *max_element(maxProfit.begin(), maxProfit.end()) << endl;
}
/*
3
4 2200 700
2 1800 10
4 2000 750
3
1 1500 300
6 1900 1500
3 2400 4550
*/

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:33:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Order>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |     for(int i = 0; i < shops.size(); i++) {
      |                    ~~^~~~~~~~~~~~~~

Subtask #1
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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 3 ms 340 KB Output is correct
8 Correct 3 ms 340 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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 46 ms 724 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 224 ms 1236 KB Output is correct
8 Correct 34 ms 468 KB Output is correct
9 Correct 321 ms 1748 KB Output is correct

Subtask #3
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 0 ms 340 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 1 ms 212 KB Output is correct
3 Correct 13 ms 444 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 391 ms 1236 KB Output is correct
6 Correct 693 ms 1916 KB Output is correct
7 Correct 776 ms 1936 KB Output is correct
8 Correct 707 ms 1956 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 37 ms 756 KB Output is correct
4 Correct 10 ms 412 KB Output is correct
5 Correct 654 ms 1908 KB Output is correct
6 Correct 705 ms 1920 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 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 3 ms 340 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 46 ms 724 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 224 ms 1236 KB Output is correct
16 Correct 34 ms 468 KB Output is correct
17 Correct 321 ms 1748 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 340 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 1 ms 212 KB Output is correct
28 Correct 13 ms 444 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 391 ms 1236 KB Output is correct
31 Correct 693 ms 1916 KB Output is correct
32 Correct 776 ms 1936 KB Output is correct
33 Correct 707 ms 1956 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 37 ms 756 KB Output is correct
37 Correct 10 ms 412 KB Output is correct
38 Correct 654 ms 1908 KB Output is correct
39 Correct 705 ms 1920 KB Output is correct
40 Correct 41 ms 724 KB Output is correct
41 Correct 122 ms 852 KB Output is correct
42 Correct 8 ms 468 KB Output is correct
43 Correct 783 ms 2072 KB Output is correct
44 Correct 766 ms 2104 KB Output is correct
45 Correct 748 ms 2068 KB Output is correct
46 Correct 4 ms 340 KB Output is correct
47 Correct 8 ms 468 KB Output is correct
48 Correct 8 ms 468 KB Output is correct