oj.uz

답안 #761706

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
761706 2023-06-20T07:22:19 Z vgoofficial Cloud Computing (CEOI18_clo) C++14
100 / 100
 398 ms 2008 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct Order {
    ll numCores, clockRate, money;
    bool operator<(Order other) {
        if(other.clockRate>clockRate) {
            return false;
        }
        return true;
    }
};
int main() {
    ios_base::sync_with_stdio(false); 
    cin.tie(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;
        shops.push_back(temp);
    }
    sort(shops.begin(), shops.end(),[](const Order &a, const Order &b) -> bool{
        return a.clockRate > b.clockRate;
    });
    vector<Order> customers;
    cin >> m;
    for(int i = 0; i < m; i++) {
        Order temp;
        cin >> temp.numCores >> temp.clockRate >> temp.money;
        customers.push_back(temp);
    }
    sort(customers.begin(), customers.end(),[](const Order &a, const Order &b) -> bool{
        return a.clockRate > b.clockRate;
    });
    ll maxProfit[50*(n+1)+1];
    for(int j = 0; j <= 50*(n+1); j++) {
        maxProfit[j]=-1e14;
    }
    int customerIndex = 0;
    while(shops[0].clockRate<customers[customerIndex].clockRate) customerIndex++;
    maxProfit[0]=0;
    for(int i = 1; i < n+1; i++) {
        ll tempMaxProfit[50*(n+1)+1];
        for(int j = 0; j <= 50*(n+1); j++) {
            tempMaxProfit[j]=-1e14;
        }
        for(int j = 0; j <= 50*(i-1); j++) {
            tempMaxProfit[j]=max(tempMaxProfit[j], maxProfit[j]); //dont buy from this shop
            tempMaxProfit[j+shops[i-1].numCores]=max(tempMaxProfit[j+shops[i-1].numCores], maxProfit[j]-shops[i-1].money); //buy from this shop
        }
        while(customerIndex<m) {
            if(i!=n) {
                if(customers[customerIndex].clockRate<=shops[i].clockRate) {
                    break;
                }
            }
            for(int j = customers[customerIndex].numCores; j <= 50*(n+1); j++) {
                tempMaxProfit[j-customers[customerIndex].numCores]=max(tempMaxProfit[j-customers[customerIndex].numCores], tempMaxProfit[j]+customers[customerIndex].money);
            }
            customerIndex++;
        }
        for(int j = 0; j <= 50 * (n+1); j++) {
            maxProfit[j]=tempMaxProfit[j];
        }
    }
    ll ans = 0;
    for(int i = 0; i <= 50 * (n+1); i++) {
        ans=max(ans, maxProfit[i]);
    }
    cout << ans << endl;
}
/*
3
4 2200 700
2 1800 10
4 2000 750
3
1 1500 300
6 1900 1500
3 2400 4550
*/

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 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 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 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 47 ms 980 KB Output is correct
6 Correct 50 ms 1048 KB Output is correct
7 Correct 230 ms 1956 KB Output is correct
8 Correct 235 ms 1956 KB Output is correct
9 Correct 224 ms 1996 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 384 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 5 ms 468 KB Output is correct
6 Correct 6 ms 468 KB Output is correct
7 Correct 6 ms 468 KB Output is correct
8 Correct 7 ms 512 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 136 ms 1492 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 353 ms 2004 KB Output is correct
6 Correct 377 ms 2004 KB Output is correct
7 Correct 375 ms 2004 KB Output is correct
8 Correct 389 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 23 ms 800 KB Output is correct
4 Correct 72 ms 980 KB Output is correct
5 Correct 375 ms 1984 KB Output is correct
6 Correct 383 ms 2004 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 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 47 ms 980 KB Output is correct
14 Correct 50 ms 1048 KB Output is correct
15 Correct 230 ms 1956 KB Output is correct
16 Correct 235 ms 1956 KB Output is correct
17 Correct 224 ms 1996 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 384 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 5 ms 468 KB Output is correct
23 Correct 6 ms 468 KB Output is correct
24 Correct 6 ms 468 KB Output is correct
25 Correct 7 ms 512 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 136 ms 1492 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 353 ms 2004 KB Output is correct
31 Correct 377 ms 2004 KB Output is correct
32 Correct 375 ms 2004 KB Output is correct
33 Correct 389 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 23 ms 800 KB Output is correct
37 Correct 72 ms 980 KB Output is correct
38 Correct 375 ms 1984 KB Output is correct
39 Correct 383 ms 2004 KB Output is correct
40 Correct 24 ms 724 KB Output is correct
41 Correct 69 ms 980 KB Output is correct
42 Correct 234 ms 1624 KB Output is correct
43 Correct 385 ms 2004 KB Output is correct
44 Correct 390 ms 2008 KB Output is correct
45 Correct 398 ms 2008 KB Output is correct
46 Correct 98 ms 1108 KB Output is correct
47 Correct 227 ms 1600 KB Output is correct
48 Correct 242 ms 1600 KB Output is correct