# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
197729 | HellAngel | Triple Jump (JOI19_jumps) | C++14 | 1331 ms | 99576 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>
#define int long long
using namespace std;
const int maxn = 5e5 + 7;
stack<int> st;
int n, m, a[maxn], ans[maxn];
vector<pair<int, int>> q[maxn];
vector<int> p[maxn];
struct Node
{
int l, r, ans;
Node(){};
Node(int l, int r, int ans): l(l), r(r), ans(ans) {};
Node operator + (const Node &other) const {
Node cc;
cc.l = max(l, other.l);
cc.r = max(r, other.r);
cc.ans = max({ans, other.ans, l + other.r});
return cc;
}
} IT[4 * maxn];
void Build(int id, int l, int r)
{
if(l == r)
{
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... |