-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathpractise.cpp
More file actions
64 lines (64 loc) · 1.33 KB
/
Copy pathpractise.cpp
File metadata and controls
64 lines (64 loc) · 1.33 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
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define db double
#define pi 2*acos(0.0)
#define MAX 100009
ll sum[MAX],b[MAX],a[MAX];
int main()
{
ll i,j,k,l,r,n,m,x;
cin>>n>>m;
ll sq=sqrt(n);
for(i=0; i<n; i++)
{
cin>>a[i];
b[i/sq]+=a[i];
}
while(m--)
{
cin>>l>>r>>x;
l--;
r--;
if(x>0)
{
ll lb=l/sq;
ll rb=r/sq;
for(i=l; i<sq*(lb+1)&&i<=r; i++)
{
b[i/sq]+=x;
a[i]+=x;
}
for(i=rb*sq; i<=r; i++)
{
b[i/sq]+=x;
a[i]+=x;
}
for(i=lb+1; i<rb; i++)
{
sum[i]+=x;
}
}
else
{
ll result=0;
ll lb=l/sq;
ll rb=r/sq;
for(i=l; i<sq*(lb+1)&&i<=r; i++)
{
result+=a[i]+sum[i/sq];
}
for(i=rb*sq; i<=r; i++)
{
result+=a[i]+sum[i/sq];
}
for(i=lb+1; i<rb; i++)
{
result+=b[i]+sum[i]*sq;
}
cout<<result<<endl;
}
}
return 0;
}