-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path295A.cpp
More file actions
217 lines (126 loc) · 3.18 KB
/
295A.cpp
File metadata and controls
217 lines (126 loc) · 3.18 KB
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
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
#include <bits/stdc++.h>
using namespace std;
struct pesquisa{
long long l,r,v;
};
long long arr[200000];
long long tree1[300000];
long long tree2[300000];
long long lazy1[3000000];
long long lazy2[3000000];
void propagate2(long long no,long long l,long long r){
tree2[no] += (r-l+1)*lazy2[no];
if(l!=r){
lazy2[no*2] += lazy2[no];
lazy2[no*2+1] += lazy2[no];
}
lazy2[no] = 0;
}
void update2(long long no,long long l,long long r,long long x,long long y){
propagate2(no,l,r);
if(r < x || y < l){
return ;
}
if(x <= l && r <= y){
tree2[no] += r-l+1;
if(l!=r){
lazy2[no*2]++;
lazy2[no*2+1]++;
}
return ;
}
long long mid = (l+r)/2;
update2(no*2,l,mid,x,y);
update2(no*2+1,mid+1,r,x,y);
tree2[no] = tree2[no*2]+tree2[no*2+1];
}
long long query2(long long no,long long l,long long r,long long x,long long y){
if(r < x || y < l){
return 0;
}
propagate2(no,l,r);
if(x <= l && r <= y){
return tree2[no];
}
long long mid = (l+r)/2;
long long r1 = query2(no*2,l,mid,x,y);
long long r2 = query2(no*2+1,mid+1,r,x,y);
return r1 + r2;
}
void build1(long long no,long long l,long long r){
if(l==r){
tree1[no] = arr[l];
return ;
}
long long mid = (l+r)/2;
build1(no*2,l,mid);
build1(no*2+1,mid+1,r);
tree1[no] = tree1[no*2] + tree1[no*2+1];
}
void propagate1(long long no,long long l,long long r){
tree1[no] += (r-l+1)*lazy1[no];
if(l!=r){
lazy1[no*2] += lazy1[no];
lazy1[no*2+1] += lazy1[no];
}
lazy1[no] = 0;
}
void update1(long long no,long long l,long long r,long long x,long long y,long long v){
propagate1(no,l,r);
if(r < x || y < l){
return ;
}
if(x <= l && r <= y){
tree1[no] += (r-l+1) * v;
if(l!=r){
lazy1[no*2] += v;
lazy1[no*2+1] += v;
}
return;
}
long long mid = (l+r)/2;
update1(no*2,l,mid,x,y,v);
update1(no*2+1,mid+1,r,x,y,v);
tree1[no] = tree1[no*2] + tree1[no*2+1];
}
long long query1(long long no,long long l,long long r,long long x,long long y){
if(r < x || y < l){
return 0;
}
propagate1(no,l,r);
if(x <= l && r <= y){
return tree1[no];
}
long long mid = (l+r)/2;
long long r1 = query1(no*2,l,mid,x,y);
long long r2 = query1(no*2+1,mid+1,r,x,y);
return r1 + r2;
}
int main(){
long long n,m,k;
cin >> n >> m >> k;
for(register long long i=0;i<n;i++){
cin >> arr[i];
}
pesquisa pesquisas[m];
for(register long long i=0;i<m;i++){
cin >> pesquisas[i].l >> pesquisas[i].r >> pesquisas[i].v;
}
for(register long long i=0;i<k;i++){
long long a,b;
cin >> a >> b;
update2(1,0,m-1,a-1,b-1);
}
build1(1,0,n-1);
for(register long long i=0;i<m;i++){
long long times = query2(1,0,m-1,i,i);
long long l = pesquisas[i].l;
long long r = pesquisas[i].r;
long long v = pesquisas[i].v;
update1(1,0,n-1,l-1,r-1,v*times);
}
for(register long long i=0;i<n;i++){
cout << query1(1,0,n-1,i,i) << " ";
}
return 0;
}