Competitive-Programming/Segment Tree.cpp at master · akumar1503/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
// SUM
struct segtree{
	int s[N*4], lzy[N*4];
	int *a;
	void build(int id = 1,int l = 0,int r = n-1){
		if(r == l){	//	l + 1 == r
			s[id] = a[l];
			return ;
		}
		int mid = (l+r)>>1;
		build(id * 2, l, mid);
		build(id * 2 + 1, mid + 1, r);
		s[id] = s[id * 2] + s[id * 2 + 1];
	}
	void build(int *A,int l=0,int r=n-1){	a=A;	build(1,l,r);	}
	void upd(int p,int x,int id = 1,int l = 0,int r = n-1){
		if(r == l){	//	l = r - 1 = p
			a[p] += x;
			return ;
		}
		int mid = (l + r)>>1;
		if(p <= mid)
			upd(p, x, id * 2, l, mid);
		else
			upd(p, x, id * 2 + 1, mid+1, r);
	}
	int get(int x,int y,int id = 1,int l = 0,int r = n-1){
		if(x > r or l > y)	return 0;
		if(x <= l && r <= y)	return s[id];
		int mid = (l+r)>>1;
		return get(x, y, id * 2, l, mid) +
		       get(x, y, id * 2 + 1, mid+1, r);
	}
	void updRange(int st, int end, int x, int id = 1, int l = 0, int r = n-1){

		if(lzy[id]!=0){
			s[id]+=(r-l+1)*lzy[id];
			if(l!=r){
				lzy[2*id]+=lzy[id];
				lzy[2*id+1]+=lzy[id];
			}
			lzy[id]=0;
		}
		if(r<st || l>end)return;

		if(l>=st && r<=end){
			s[id] += (r - l + 1) * x;
			if(l!=r){
				lzy[2*id] += x;
				lzy[2*id+1] += x;
			}
			return;
		}
		int mid=(l+r)>>1;
		updRange(st, end, x, 2*id, l, mid);
		updRange(st, end, x, 2*id + 1, mid + 1, r);
		s[id]=s[2*id] + s[2*id + 1];

	}
	int getRange(int x,int y,int id = 1,int l = 0,int r = n-1){
		if(x > r or l > y)	return 0;
		if(lzy[id]!=0){
			s[id]+=(r-l+1)*lzy[id];
			if(l!=r){
				lzy[2*id] += lzy[id];
				lzy[2*id+1] += lzy[id];
			}
			lzy[id]=0;
		}
		if(x <= l && r <= y)	return s[id];
		int mid = (l+r)>>1;
		return get(x, y, id * 2, l, mid) +
		       get(x, y, id * 2 + 1, mid+1, r);
	}

}


//Product change a[i]=x
pii operator*(const pii &f,const pii &s){
        pii p;
        p.fi = (1ll * f.fi * s.fi) % MOD;
        p.se = (1ll * f.se * s.se) % MOD;
        return p;
}
pii operator%(const pii &f,const LL &m){
        pii p;
        p.fi = f.fi % MOD;
        p.se = f.se % MOD;
        return p;
}
struct segtree{
    pii s[N*4];
    LL *a, lzy[N*4];

    void build(LL id = 1,LL l = 0,LL r = n-1){
        if(r<l)return;
        if(r == l){
            s[id] = pii(a[l],a[l]-1);
            return ;
        }
        LL mid = (l+r)>>1;
        build(id * 2, l, mid);
        build(id * 2 + 1, mid + 1, r);
        s[id] = ( s[id * 2] * s[id * 2 + 1] ) % MOD;
    }
    void build(LL *A,LL l=0,LL r=n-1){
        a=A;  build(1,l,r);
        fill(&lzy[0], &lzy[0] + 4 * N, 0);
    }

    void updRange(LL st, LL end, LL x, LL id = 1, LL l = 0, LL r = n-1){
        if(lzy[id]){
            s[id] = pii(modularExp(lzy[id], r-l+1), modularExp(lzy[id]-1, r - l + 1));
            if(l!=r){
                lzy[2*id] = lzy[id];
                lzy[2*id+1] = lzy[id];
            }
            lzy[id]=0;
        }
        if(r<st || l>end)return;
        if(l >= st && r <= end){
            s[id] = pii(modularExp(x, r - l +1), modularExp(x - 1, r - l + 1));
            if(l != r){
                lzy[2*id] = x;
                lzy[2*id+1] = x;
            }
            return;
        }
        LL mid=(l+r)>>1;
        updRange(st, end, x, 2*id, l, mid);
        updRange(st, end, x, 2*id + 1, mid + 1, r);
        s[id] = (s[2*id] * s[2*id + 1]) % MOD;
    }
    pii getRange(LL x,LL y,LL id = 1,LL l = 0,LL r = n-1){
        if(lzy[id]){
            s[id] = pii(modularExp(lzy[id], r - l +1), modularExp(lzy[id] - 1, r - l + 1));
            if(l != r){
                lzy[2*id] = lzy[id];
                lzy[2*id+1] = lzy[id];
            }
            lzy[id]=0;
        }
        if(r < x || l > y)  return pii(1,1);
        if(l >= x && r <= y)    return s[id];

        LL mid = (l+r)>>1;
        pii sd = (getRange(x, y, id * 2, l, mid) * getRange(x, y, id * 2 + 1, mid+1, r)) % MOD;
        return sd;
    }
} t;