Submission #1117326

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1117326	2024-11-23 10:10:04	pacman	Triple Jump (JOI19_jumps)	C++14	100 / 100	1680 ms	154952 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>
#define int long long int
using namespace std;
const int maxn = 1e6 + 100;
int n ,Q ,a[maxn], ans[maxn] ,sz = 1;
vector<pair<int ,int>> q[maxn];
vector<int> baze[maxn];
struct segment_tree{
    int seg[maxn * 2], lazy[maxn * 2], maxi[maxn * 2];
    segment_tree(){
        for(int i = 0; i < maxn * 2; i++){
            seg[i] = 0 ,lazy[i] = 0, maxi[i] = 0;
        }
    }
    void build_max(){
        for(int i = sz - 1; i >= 0 ;i--){
            maxi[i] = max(maxi[2 * i], maxi[2 * i + 1]);
        }
    }
    void push(int v, int L, int R){
        if(L == R) return;
        lazy[v * 2] = max(lazy[v * 2], lazy[v]);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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