Competitive_Programming/Structures/persistent_seg.cpp at master · jonh14lk/Competitive_Programming · 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
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

template <class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define int long long int
#define pb push_back
#define pi pair<int, int>
#define pii pair<pi, int>
#define fir first
#define sec second
#define MAXN 100003
#define mod 1000000007

int v[MAXN];

namespace seg
{
  struct node
  {
    int item, lazy, lazy_status, l, r;
    node() {}
    node(int l, int r, int lazy, int lazy_status, int item) : l(l), r(r), lazy(lazy), lazy_status(lazy_status), item(item) {}
  };

  vector<node> seg;
  vector<int> roots;

  void init()
  {
    seg.resize(1);
  }
  int neutral()
  {
    return 0;
  }
  int merge(int a, int b)
  {
    return a + b;
  }
  int newleaf(int vv)
  {
    int p = seg.size();
    seg.pb(node(0, 0, 0, 0, vv));
    return p;
  }
  int newparent(int l, int r)
  {
    int p = seg.size();
    seg.pb(node(l, r, 0, 0, merge(seg[l].item, seg[r].item)));
    return p;
  }
  int newkid(int i, int diff, int l, int r)
  {
    int p = seg.size();
    seg.pb(node(seg[i].l, seg[i].r, seg[i].lazy + diff, 1, seg[i].item + ((r - l + 1) * diff)));
    return p;
  }
  void add(int i, int l, int r)
  {
    if (!seg[i].lazy_status)
      return;
    if (l != r)
    {
      int mid = (l + r) >> 1;
      seg[i].l = newkid(seg[i].l, seg[i].lazy, l, mid);
      seg[i].r = newkid(seg[i].r, seg[i].lazy, mid + 1, r);
    }
    seg[i].lazy = 0;
    seg[i].lazy_status = 0;
  }
  int update(int i, int l, int r, int ql, int qr, int diff)
  {
    if (l > r || l > qr || r < ql)
      return i;
    if (l >= ql && r <= qr)
      return newkid(i, diff, l, r);
    add(i, l, r);
    int mid = (l + r) >> 1;
    return newparent(update(seg[i].l, l, mid, ql, qr, diff), update(seg[i].r, mid + 1, r, ql, qr, diff));
  }
  int query(int l, int r, int ql, int qr, int i)
  {
    if (l > r || l > qr || r < ql)
      return neutral();
    if (l >= ql && r <= qr)
      return seg[i].item;
    add(i, l, r);
    int mid = (l + r) >> 1;
    return merge(query(l, mid, ql, qr, seg[i].l), query(mid + 1, r, ql, qr, seg[i].r));
  }
  int build(int l, int r)
  {
    if (l == r)
      return newleaf(v[l]);
    int mid = (l + r) >> 1;
    return newparent(build(l, mid), build(mid + 1, r));
  }
}
signed main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, q;
  cin >> n >> q;
  for (int i = 0; i < n; i++)
    cin >> v[i];
  seg::init();
  int root = seg::build(0, n - 1);
  seg::roots.pb(root);
  while (q--)
  {
    char t;
    cin >> t;
    if (t == 'C')
    {
      int l, r, d;
      cin >> l >> r >> d;
      l--, r--;
      int root = seg::update(seg::roots.back(), 0, n - 1, l, r, d);
      seg::roots.pb(root);
    }
    else if (t == 'Q')
    {
      int l, r;
      cin >> l >> r;
      l--, r--;
      cout << seg::query(0, n - 1, l, r, seg::roots.back()) << endl;
    }
    else if (t == 'H')
    {
      int l, r, d;
      cin >> l >> r >> d;
      l--, r--;
      cout << seg::query(0, n - 1, l, r, seg::roots[d]) << endl;
    }
    else
    {
      int d;
      cin >> d;
      while (seg::roots.size() > d + 1)
        seg::roots.pop_back();
    }
  }
  return 0;
}
// https://www.spoj.com/problems/TTM/
// rollback segtree to a time stamp t