| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 996939 | aykhn | Cloud Computing (CEOI18_clo) | C++17 | 1265 ms | 7164 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;
#define int long long
#define inf 0x3F3F3F3F3F3F3F3F
const int MXN = 3e5 + 5;
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<array<int, 3>> a(n);
for (array<int, 3> &i : a)
{
cin >> i[1] >> i[0] >> i[2];
i[2] = -i[2];
}
int m;
cin >> m;
for (int i = 0; i < m; i++)
{
array<int, 3> x;
cin >> x[1] >> x[0] >> x[2];
x[1] = -x[1];
a.push_back(x);
}
sort(a.rbegin(), a.rend());
int s = 0;
vector<int> ndp, dp = {0};
for (array<int, 3> &x : a)
{
s += abs(x[1]);
ndp.assign(s + 1, -inf);
for (int i = 0; i < dp.size(); i++)
{
ndp[i] = max(ndp[i], dp[i]);
if (i + x[1] >= 0) ndp[i + x[1]] = max(ndp[i + x[1]], dp[i] + x[2]);
}
swap(ndp, dp);
}
cout << *max_element(dp.begin(), dp.end()) << '\n';
}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... | ||||
