# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
483367 | BERNARB01 | Cloud Computing (CEOI18_clo) | C++17 | 466 ms | 2124 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>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, s = 0;
cin >> n;
vector<array<int, 4>> a(n);
for (int i = 0; i < n; i++) {
int c, f, v;
cin >> c >> f >> v;
a[i] = {-f, 0, c, -v};
s += c;
}
cin >> m;
a.resize(n + m);
for (int i = 0; i < m; i++) {
int c, f, v;
cin >> c >> f >> v;
a[i + n] = {-f, 1, -c, v};
}
sort(a.begin(), a.end());
const long long inf = (long long) 1e18L;
vector<long long> dp(s + 51, -inf);
dp[0] = 0;
vector<long long> pd(s + 51);
for (int i = 0; i < n + m; i++) {
int c = a[i][2], v = a[i][3];
# | 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... |