Submission #529178

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
529178	2022-02-22 10:59:06	Fake4Fun	Triple Jump (JOI19_jumps)	C++14	100 / 100	922 ms	98976 KiB

jumps

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<iostream>
#include<vector>
#define pa pair<int,int>
#define fi first
#define se second
using namespace std;
using ui=unsigned int;
const int N=5e5+5;
int n,q;
int a[N],p[N];
vector<int> wait[N];
vector<pa> que[N];
int xl[N<<2],xr[N<<2];
bool ok[N<<2];
ui IT[N<<2],ma[N<<2],ans[N];
int lazy[N<<2];
void build(int x=1,int l=1,int r=n){
    xl[x]=l, xr[x]=r;
    if(l==r){ma[x]=a[l]; return;}
    int xm=(l+r)>>1;
    build(x<<1,l,xm); build(x<<1|1,xm+1,r);
    ma[x]=max(ma[x<<1],ma[x<<1|1]);
}
void fix(int x,int C){
    if(C<=lazy[x]) return;
    ok[x]=1, lazy[x]=C;
    IT[x]=max(IT[x],ma[x]+C);
}
void down(int x){
    for(int i=x<<1;i<=(x<<1|1);i++)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 14 / 14
• Subtask 3: 27 / 27
• Subtask 4: 54 / 54