# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
335138 | Mo_TOI_I_am_Garbage | Triple Jump (JOI19_jumps) | C++14 | 1350 ms | 92988 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 int
#define No_TOI_I_am_Garbage ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
int n, a[500050], q;
vector<pair<int, int> > seg;
struct thing {
int left, right, v1, v2, lz;
} arr[500050 << 2];
void build(int left, int right, int m)
{
arr[m].left = left; arr[m].right = right;
arr[m].lz = 0;
if(left == right)
{
arr[m].v1 = arr[m].v2 = a[left];
return;
}
int mid = (left + right) >> 1;
build(left, mid, m * 2);
build(mid + 1, right, m * 2 + 1);
arr[m].v2 = max(arr[m * 2].v2, arr[m * 2 + 1].v2);
arr[m].v1 = arr[m].v2;
}
void down(int m)
{
arr[m * 2].v1 = max(arr[m * 2].v1, arr[m * 2].v2 + arr[m].lz);
arr[m * 2 + 1].v1 = max(arr[m * 2 + 1].v1, arr[m * 2 + 1].v2 + arr[m].lz);
arr[m * 2].lz = max(arr[m].lz, arr[m * 2].lz);
arr[m * 2 + 1].lz = max(arr[m].lz, arr[m * 2 + 1].lz);
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... |