Submission #502930

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
502930	2022-01-06 18:46:00	amunduzbaev	Triple Jump (JOI19_jumps)	C++14	100 / 100	1298 ms	106564 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;
 
#define ar array
#define int long long
const int N = 5e5 + 5;
struct ST{
  int tree[N * 4], add[N * 4], p[N * 4];
  void sett(int i, int v, int lx = 0, int rx = N, int x = 1){
    if(lx == rx) { add[x] = v; return; }
    int m = (lx + rx) >> 1;
    if(i <= m) sett(i, v, lx, m, x<<1);
    else sett(i, v, m+1, rx, x<<1|1);
    add[x] = max(add[x<<1], add[x<<1|1]);
  }
  
  void push(int x, int lx, int rx){
    if(lx == rx || !p[x]) return;
    tree[x<<1] = max(tree[x<<1], p[x] + add[x<<1]);
    tree[x<<1|1] = max(tree[x<<1|1], p[x] + add[x<<1|1]);
    p[x<<1] = max(p[x<<1], p[x]), p[x<<1|1] = max(p[x<<1|1], p[x]);
    p[x] = 0; 
  }
  
  void umax(int l, int r, int v, int lx = 0, int rx = N, int x = 1){
    if(lx > r || rx < l) return;
    if(lx >= l && rx <= r){
      tree[x] = max(tree[x], v + add[x]);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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