# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
307024 | VROOM_VARUN | Cloud Computing (CEOI18_clo) | C++14 | 585 ms | 1528 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 <vector>
#include <algorithm>
using namespace std;
struct Event {
enum Type { Processor, Task };
Type type;
int cores, frequency, price;
Event(Type type, int cores, int frequency, int price)
: type(type), cores(cores), frequency(frequency), price(price) { }
};
const int MAXN = 2005, MAXC = 55, MAXDP = MAXN*MAXC;
const long long int INF = 1000000000000000000LL; // 10^18
int n,m;
vector<Event> events;
long long int dp[MAXDP];
bool comp(const Event& event1, const Event& event2) {
if (event1.frequency == event2.frequency)
return event1.type < event2.type;
return event1.frequency > event2.frequency;
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
int c,f,v;
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... |