-
Notifications
You must be signed in to change notification settings - Fork 0
/
lightOJ__1164(bit).c
executable file
·68 lines (58 loc) · 1.86 KB
/
lightOJ__1164(bit).c
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
#include <stdio.h>
#include <string.h>
#define MAXN 100005
long n;
long long tree[MAXN+1];
long long X[MAXN + 1];
/*
add x over [a...b] => add(a, x), add(b+1, -x), sum(l) returns actual value of lth index.
sum over [a...b] =>
Now, consider Sum(0..p) for all possible p
1. 0 <= p < a : 0 : 0 * p - 0
2. a <= p <= b : v * ( p - (a-1) ) : v * p - v * ( a - 1 )
3. b < p < n : v * ( b - (a-1) ) : 0 * p - v * b + v * ( a - 1 )
*/
void add(long long *a, long ind, long x){
while ( ind <= n ) {
a[ind] += x;
ind += ind & -ind;
}
}
long long sum(long long *a, long ind){
long long sm = 0;
while ( ind ) {
sm += a[ind];
ind -= ind & -ind;
}
return sm;
}
int main(){
int command, test, kase;
long x, l, r, q;
/* range update and range sum query */
while ( scanf("%d", &test) == 1 ){
for ( kase = 1 ; kase <= test ; kase++ ){
printf("Case %d:\n", kase);
scanf("%ld%ld", &n, &q);
for ( l = 0 ; l <= n ; l++ ) tree[l] = X[l] = 0;
while ( q-- ){
scanf("%d", &command);
if ( command == 0 ){
scanf("%ld%ld%ld", &l, &r, &x);
l++, r++;
add(tree, l, x);
add(tree, r + 1, -x);
add(X, l, x * ( l - 1));
add(X, r + 1, -x * r );
}
else if ( command == 1 ){
scanf("%ld%ld", &l, &r);
r++;
/*printf("Element at %d = %d\n", l, sum(tree, l));*/
printf("%lld\n", (r * sum(tree, r) - sum(X, r)) - (l * sum(tree, l) - sum(X, l)));
}
}
}
}
return 0;
}