# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
124767 | eriksuenderhauf | Cloud Computing (CEOI18_clo) | C++11 | 801 ms | 2168 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.
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ni(n) scanf("%d\n", &(n))
#define prl(n) printf("%lld\n", (n))
using namespace std;
typedef long long ll;
const ll INF = 1e18 + 7;
const int MAXN = 1e5 + 5;
struct order {
int c, f, v;
bool operator<(const order &rhs) const {
if (f == rhs.f)
return c > rhs.c;
return f > rhs.f;
}
} b[4005];
ll dp[2][MAXN];
int main()
{
int n, m;
ni(n);
for (int i = 0; i < n; i++) { // cores, frequency, value
scanf("%d %d %d", &b[i].c, &b[i].f, &b[i].v);
b[i].v *= -1;
}
ni(m);
for (int i = n; i < n + m; i++) { // cores, frequency, value
scanf("%d %d %d", &b[i].c, &b[i].f, &b[i].v);
b[i].c *= -1;
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... |