algorithms/Data_Structures/persistent_segment_tree/Persistent_Segment_Tree(static).cpp at master · Saikat-S/algorithms · GitHub

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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
/***************************************************
 * Problem Name : Persistent_Segment_Tree(static).cpp
 * Problem Link : Basic Code
 * Verdict      : Done
 * Date         : 2020-07-28
 * Problem Type : Data Structure
 * Author Name  : Saikat Sharma
 * University   : CSE, MBSTU
 ***************************************************/
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cstring>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <cstdlib>
#include <deque>
#include <stack>
#include <bitset>
#include <cassert>
#include <map>
#include <set>
#include <cassert>
#include <iomanip>
#include <random>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;

#define __FastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define __FileRead freopen ("input.txt", "r", stdin)
#define __FileWrite freopen ("output.txt", "w", stdout)
#define SET(a,v) memset(a,v,sizeof(a))
#define SZ(v) (int)v.size()
#define pii pair<ll,ll>
#define pll pair <ll, ll>
#define debug cout <<"######\n"
#define debug1(x) cout <<"### " << x << " ###\n"
#define debug2(x,y) cout <<"# " << x <<" : "<< y <<" #\n"
#define nl cout << "\n";
#define sp cout << " ";
#define sl(n) scanf("%lld", &n)
#define sf(n) scanf("%lf", &n)
#define si(n) scanf("%d", &n)
#define ss(n) scanf("%s", n)
#define pf(n) scanf("%d", n)
#define pfl(n) scanf("%lld", n)
#define all(v) v.begin(), v.end()
#define srt(v) sort(v.begin(), v.end())
#define r_srt(v) sort(v.rbegin(), v.rend())
#define rev(v) reverse(v.rbegin(), v.rend())
#define Sqr(x) ((x)*(x))
#define Mod(x, m) ((((x) % (m)) + (m)) % (m))
#define Max3(a, b, c) max(a, max(b, c))
#define Min3(a, b, c) min(a, min(b, c))
#define pb push_back
#define mk make_pair
#define F first
#define S second
#define MAX 100005
#define INF 1000000009
#define MOD 1000000007

template<class T>
using min_heap = priority_queue<T, std::vector<T>, std::greater<T>>;
template<typename T>
using ordered_set  = tree<T, null_type, less<T>, rb_tree_tag,
      tree_order_statistics_node_update>;

/************************************ Code Start Here ******************************************************/
struct Node {
    int left, right, data;
} tr[MAX * 20];

int root[MAX], ar[MAX], id;

void build (int nod, int low, int high) {
    if (low == high) {
        tr[nod].data = ar[low];
        return;
    }

    int mid = (high + low) / 2;
    tr[nod].left = ++id, tr[nod].right = ++id;
    build (tr[nod].left, low, mid);
    build (tr[nod].right, mid + 1, high);
    tr[nod].data = tr[tr[nod].left].data + tr[tr[nod].right].data;
}

int update (int nod, int low, int high, int pos, int val) {
    if (low > pos || high < pos) {
        return nod;
    }

    if (low == high) {
        tr[++id] = tr[nod];
        tr[id].data += val;
        return id;
    }

    int mid = (high + low) / 2;
    tr[++id] = tr[nod], nod = id;
    tr[nod].left = update (tr[nod].left, low, mid, pos, val);
    tr[nod].right = update (tr[nod].right, mid + 1, high, pos, val);
    tr[nod].data = tr[tr[nod].left].data + tr[tr[nod].right].data;
    return nod;
}

int query (int nod, int low, int high, int qlow, int qhigh) {
    if (qlow > high || qhigh < low) {
        return 0;
    }

    if (low >= qlow && high <= qhigh) {
        return tr[nod].data;
    }

    int mid = (high + low) / 2;
    int a = query (tr[nod].left, low, mid, qlow, qhigh);
    int b = query (tr[nod].right, mid + 1, high, qlow, qhigh);
    return (a + b);
}

int main () {
    __FastIO;
    int n;
    cin >> n;

    for (int i = 0; i < n; i++) {
        cin >> ar[i];
    }

    id = 1;
    root[0] = id;
    build (root[0], 0, n - 1);
    int q;
    cin >> q;
    int h = 1;

    while (q--) {
        int c;
        cin >> c;

        if (c == 1) {
            int id, pos, val;
            cin >> id >> pos >> val;
            pos--;
            root[h++] = update (root[id], 0, n - 1, pos, val);

        } else {
            int id, l, r;
            cin >> id >> l >> r;
            l--, r--;
            int res = query (root[id], 0, n - 1, l, r);
            cout << res << "\n";
        }
    }

    return 0;
}
// This code is the solution of
//~ https://www.spoj.com/problems/PSEGTREE/
//~ problem