# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1175711 | _ncng.nyr | Triple Jump (JOI19_jumps) | C++20 | 781 ms | 74904 KiB |
#include<bits/stdc++.h>
#define int long long
#define ii pair<int, int>
using namespace std;
const int N = 5e5 + 5,
oo = 1e16;
int n, q;
int a[N];
vector<ii> query[N];
struct Node {
int ab, c, opt;
};
void maximize(int &x, int y) { x = max(x, y); }
struct SegmentTree {
Node T[N << 2];
int lz[N << 2];
void build(int s, int l, int r) {
if(l == r) {
T[s] = {-oo, a[l], -oo};
return;
}
int mid = l + r >> 1;
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... |