Submission #396442

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
396442	2021-04-30 00:39:02	Osama_Alkhodairy	Triple Jump (JOI19_jumps)	C++17	100 / 100	1614 ms	87824 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 finish(x) return cout << x << endl, 0
#define ll long long
const int N = 500001;
struct item{
    int mx_f, mx_a, mx;
};
int n, q;
vector <int> a, v[N];
vector <pair <int, int> > qu[N];
item tree[4 * N];
item merge(item a, item b){
    item ret = a;
    ret.mx_f = max(ret.mx_f, b.mx_f);
    ret.mx_a = max(ret.mx_a, b.mx_a);
    ret.mx = max(ret.mx, max(b.mx, a.mx_f + b.mx_a));
    return ret;
}
void update(int l, int r, int node, int idx, item c){
    if(r < l || r < idx || l > idx) return;
    if(l == r){
        tree[node].mx_f = max(tree[node].mx_f, c.mx_f);
        tree[node].mx_a = max(tree[node].mx_a, c.mx_a);
        tree[node].mx = tree[node].mx_f + tree[node].mx_a;
        return;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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