제출 #761647

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
761647		vgoofficial	Cloud Computing (CEOI18_clo)	C++14	54 / 100	578 ms	2004 KiB

clo

#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;
        temp.money=-temp.money;
        shops.push_back(temp);
    }
    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());
    ll maxProfit[50*(n+1)+1];
    for(int j = 0; j <= 50*(n+1); j++) {
        maxProfit[j]=-1e14;
    }
    maxProfit[0]=0;
    for(int i = 0; i < shops.size(); i++) {
        ll tempMaxProfit[50*(n+1)+1];
        for(int j = 0; j <= 50*(n+1); j++) {
            tempMaxProfit[j]=maxProfit[j];
        }
        for(int j = 0; j <= 50*(n+1); j++) {
            int prev = j - shops[i].numCores;
            if(prev>=0&&prev<=50*(n+1)) {
                tempMaxProfit[j]=max(tempMaxProfit[j], maxProfit[prev]+shops[i].money);
            }
        }
        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
*/

컴파일 시 표준 에러 (stderr) 메시지

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

• Subtask 1: 18 / 18
• Subtask 2: 0 / 18
• Subtask 3: 18 / 18
• Subtask 4: 0 / 18
• Subtask 5: 18 / 18
• Subtask 6: 0 / 10