제출 #483371

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
483371		john256	Cloud Computing (CEOI18_clo)	C++14	100 / 100	678 ms	1948 KiB

clo

#include <bits/stdc++.h>
using namespace std;

struct Transaction {
	int cores;
	int rate;
	int price;
};

int main() {
	vector<Transaction> poss_transactions; //possible transactions

	int max_CPUS = 0; //max # of CPUS
	
	int N; cin >> N; //# of computers available
	for(int x=0; x<N; x++) {
		Transaction trans;
		cin >> trans.cores >> trans.rate >> trans.price;
		trans.price = -trans.price;
		poss_transactions.push_back(trans);
		max_CPUS += trans.cores;
	}

	int M; cin >> M; //# of orders from customers
	for(int y=0; y<M; y++) {
		Transaction trans;
		cin >> trans.cores >> trans.rate >> trans.price;
		trans.cores = -trans.cores;
		poss_transactions.push_back(trans);
	}

	//The clock rate issue goes away if we process the orders in order.
	sort(
		poss_transactions.begin(), poss_transactions.end(),
			[](const Transaction& a, const Transaction& b) {
				return a.rate != b.rate ? a.rate > b.rate : a.price < b.price;
		});

	/*
	 * max_profits[t][c] = the maximum profit we can gain from the first
	 *   t transactions given that we have c cores left
	 */
	vector<long long> max_profits(max_CPUS+1, INT64_MIN);
	max_profits[0] = 0;
	for(const Transaction& t : poss_transactions) {
		vector<long long> new_max(max_profits);
		for(int c=0; c<=max_CPUS; c++) {
			int prev_comp = c - t.cores;
			if(0 <= prev_comp && prev_comp <= max_CPUS
					&& max_profits[prev_comp] != INT64_MIN) {
				new_max[c] = max(new_max[c], max_profits[prev_comp] + t.price);
			}
		}
		max_profits = new_max;
	}
	cout << *max_element(max_profits.begin(), max_profits.end()) << endl;
}

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