# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1153533 | brover29 | Triple Jump (JOI19_jumps) | C++20 | 150 ms | 77208 KiB |
#include <bits/stdc++.h>
//qwerty47924692
using namespace std;
using ll = long long;
const ll N=5e5+29;
const string br="617283";
#define sz(a)(ll)a.size()
#define f first
#define s second
ll n,q,w[N],st[4*N],z[4*N],lg[N],l[N],r[N],ans[N];
vector<ll>v[N];
vector<pair<ll,ll>>g[N];
ll mx[N][20];
void build(){
lg[1]=0;
for(ll i=2;i<=n;i++)lg[i]=lg[i/2]+1;
for(ll j=1;j<20;j++){
ll k=(1ll<<j);
for(ll i=k-1;i<=n;i++){
mx[i][j]=max(mx[i][j-1],mx[i-k/2][j-1]);
}
}
}
ll get(ll l,ll r){
ll k=lg[r-l+1];
return max(mx[r][k],mx[l+(1ll<<k)-1][k]);
}
void push(ll v,ll l,ll r){
if(!z[v])return;
ll mid=(r+l)>>1;
# | 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... |