Submission #482279

#	Time	Username	Problem	Language	Result	Execution time	Memory
482279		Olympia	Cloud Computing (CEOI18_clo)	C++17	18 / 100	374 ms	1268 KiB

clo

#include <cmath>
#include <iostream>
#include <set>
#include <climits>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <type_traits>
#include <string>
#include <queue>
#include <map>
using namespace std;
struct Order {
    long long price; //price we gain
    long long clockspeed; //clockspeed
    long long cores; //cores we gain
};
bool comp (Order o1, Order o2) {
    if (o1.clockspeed != o2.clockspeed) {
        return (o1.clockspeed > o2.clockspeed);
    }
    return (o1.price < o2.price);
}
void print(Order a) {
    cout << "PRICE: " << a.price << endl;
    cout << "CLOCKSPEED: " << a.clockspeed << endl;
    cout << "CORES " << a.cores << endl;
    cout << "------\n";
}
int main() {
    int n;
    cin >> n;
    vector<Order> v;
    for (int i = 0; i < n; i++) {
        Order a;
        cin >> a.cores >> a.clockspeed >> a.price;
        a.price = -a.price;
        v.push_back(a);
    }
    int m;
    cin >> m;
    for (int i = 0; i < m; i++) {
        Order a;
        cin >> a.cores >> a.clockspeed >> a.price;
        a.cores = -a.cores;
        v.push_back(a);
    }
    sort(v.begin(), v.end(), comp);
    //reverse(v.begin(), v.end());
    for (auto p: v) {
        //print(p);
    }
    vector<long long> dp ((int)1e5 + 10);
    for (int i = 0; i < dp.size(); i++) {
        dp[i] = -INT_MAX;
    }
    dp[0] = 0;
    long long myMax = 0;
    for (auto p: v) {
        if (p.cores > 0 ) {
            //buy a computer
            for (int i = dp.size() - 1; i >= 0; i--) {
                if (i - abs(p.cores) < 0) continue;
                dp[i] = max(dp[i], dp[i - abs(p.cores)] - abs(p.price));
            }
        } else {
            //customer
            for (int i = 0; i < dp.size(); i++) {
                if (i + abs(p.cores) >= dp.size()) continue;
                dp[i] = max(dp[i], dp[i + abs(p.cores)] + abs(p.price));
            }
        }
    }
    for (int i = 0; i < dp.size(); i++) {
        myMax = max(myMax, dp[i]);
    }
    cout << myMax << endl;
}

Compilation message (stderr)

clo.cpp: In function 'int main()':
clo.cpp:50:15: warning: variable 'p' set but not used [-Wunused-but-set-variable]
   50 |     for (auto p: v) {
      |               ^
clo.cpp:54:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |     for (int i = 0; i < dp.size(); i++) {
      |                     ~~^~~~~~~~~~~
clo.cpp:68:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |             for (int i = 0; i < dp.size(); i++) {
      |                             ~~^~~~~~~~~~~
clo.cpp:69:38: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |                 if (i + abs(p.cores) >= dp.size()) continue;
      |                     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
clo.cpp:74:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |     for (int i = 0; i < dp.size(); i++) {
      |                     ~~^~~~~~~~~~~

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