# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
205710 | dolphingarlic | Cloud Computing (CEOI18_clo) | C++14 | 255 ms | 1292 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 <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;
struct Object {
int c;
ll f, v;
bool operator<(Object B) {
if (f == B.f) return v > B.v;
return f < B.f;
}
} obj[4001];
ll dp[100005];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n;
FOR(i, 0, n) {
cin >> obj[i].c >> obj[i].f >> obj[i].v;
obj[i].v *= -1;
}
cin >> m;
FOR(i, n, n + m) {
cin >> obj[i].c >> obj[i].f >> obj[i].v;
obj[i].c *= -1;
# | 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... |