# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
70884 | georgerapeanu | Cloud Computing (CEOI18_clo) | C++11 | 413 ms | 1516 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <algorithm>
using namespace std;
const int NMAX = 2000;
const int CORE_MAX = 50;
const int TOTAL_CORE_MAX = 2 * NMAX * CORE_MAX;
const int COST_MAX = 1e9;
const long long TOTAL_COST_MAX = 2LL * NMAX * COST_MAX;
const long long inf = (1LL << 60) - TOTAL_COST_MAX - 3;
struct order_t{
int cores;
int frequency;
int cost;
order_t(){
cores = 0;
frequency = 0;
cost = 0;
}
bool operator < (const order_t &other)const{///this sorts them in nonincreasing order based on frequency
if(frequency != other.frequency){
return frequency > other.frequency;
}
if(cost != other.cost){
return cost < other.cost;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |