Submission #932946

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
932946	2024-02-24 15:39:33	amirhoseinfar1385	Triple Jump (JOI19_jumps)	C++17	100 / 100	1089 ms	89168 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<bits/stdc++.h>
using namespace std;
const int maxn=500000+10;
int n,all[maxn],q,res[maxn],kaf=(1<<19);
vector<pair<int,int>>allq[maxn],updy[maxn];
struct segment{
  struct node{
    int mx,lazy,res;
    node(){
      mx=lazy=res=0;
    }
  };
  node seg[(1<<20)];
  void calc(int i){
    if(i>=kaf){
      seg[i].res=max(seg[i].res,seg[i].mx+seg[i].lazy);
      seg[i].lazy=0;
      return ;
    }
    seg[i].res=max(seg[i].res,max(seg[(i<<1)].res,seg[(i<<1)^1].res));
    seg[i].mx=max(seg[(i<<1)].mx,seg[(i<<1)^1].mx);
  }
  void shift(int i){
    if(i>=kaf){
      return calc(i);
    }
    seg[(i<<1)].lazy=max(seg[i].lazy,seg[(i<<1)].lazy);
    seg[(i<<1)^1].lazy=max(seg[i].lazy,seg[(i<<1)^1].lazy);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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