Submission #862601

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
862601	2023-10-18 15:27:10	Irate	Trading (IZhO13_trading)	C++14	100 / 100	197 ms	17488 KiB

trading

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;
struct SegmentTree{
    vector<int>sTree;
    vector<int>lazy;
    SegmentTree(int n){
        sTree.resize(4 * n);
        lazy.resize(4 * n);
    }
    void Propagate(int node, int l, int r){
        if(!lazy[node])return;
        if(l == r)sTree[node] = max(sTree[node], lazy[node]);
        if(l != r){
            lazy[node * 2] = max(lazy[node * 2], lazy[node]);
            lazy[node * 2 + 1] = max(lazy[node * 2 + 1], ((2 * lazy[node] + r - l) >> 1) + 1);
        }
        lazy[node] = 0;
    }
    void R_Update(int node, int l, int r, int ql, int qr, int x){
        Propagate(node, l, r);
        if(ql <= l && r <= qr){
            lazy[node] = x + l - ql;
            Propagate(node, l, r);
            return;
        }
        if(ql > r || l > qr)return;
        int mid = (l + r) >> 1;
        R_Update(node * 2, l, mid, ql, qr, x);
        R_Update(node * 2 + 1, mid + 1, r, ql, qr, x);
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 100 / 100