# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
456182 | arminatarod | Triple Jump (JOI19_jumps) | C++17 | 1587 ms | 87896 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;
constexpr int MAXN = 500005;
constexpr int MAXINT = 1073741823;
vector<int> pairs[MAXN];
vector<pair<int, int>> queries[MAXN];
stack<int> s;
int a[MAXN], answer[MAXN];
struct node {
int result = 0, maximum_pair = 0, maximum_a = 0;
} segment[MAXN * 4];
node merge(node x, node y) {
node result;
result.maximum_a = max(x.maximum_a, y.maximum_a);
result.maximum_pair = max(x.maximum_pair, y.maximum_pair);
result.result = max(x.maximum_pair + y.maximum_a, max(x.result, y.result));
return result;
}
node get_answer(int from, int to, int current, int beginning, int ending) {
node nothing;
# | 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... |