# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1134795 | dombly | Triple Jump (JOI19_jumps) | C++20 | 973 ms | 110400 KiB |
#include <bits/stdc++.h>
#define int long long
#define F first
#define S second
#define pb push_back
using namespace std;
const int N = 5e5 + 10;
const int inf = 1e15;
const int mod = 1e9 + 7;
vector<pair<int,int>>kveri[N],upd[N];
int ans[N],lazy[N * 4],a[N];
struct cvor {
int mx,ans,lazy;
};
cvor st[N * 4];
void build(int node,int tl,int tr) {
if(tl == tr) {
st[node].ans = a[tl];
st[node].mx = a[tl];
st[node].lazy = 0;
return;
}
int mid = (tl + tr) / 2;
build(node * 2,tl,mid);
build(node * 2 + 1,mid + 1,tr);
st[node].ans = max(st[node * 2].ans,st[node * 2 + 1].ans);
# | 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... |