68 lines
1.2 KiB
C++
68 lines
1.2 KiB
C++
#include <bits/stdc++.h>
|
|
#define int long long
|
|
|
|
using namespace std;
|
|
vector <long long> segtree, seglazy;
|
|
|
|
void segUnlazy(int p, int l, int r){
|
|
if(seglazy[p] == 0LL) return;
|
|
|
|
segtree[p] += seglazy[p]*(r-l+1);
|
|
if(l != r){
|
|
seglazy[p*2] += seglazy[p],
|
|
seglazy[p*2+1] += seglazy[p];
|
|
}
|
|
|
|
seglazy[p] = 0LL;
|
|
}
|
|
|
|
void segUpdate(int p, int i, int j, int l, int r, long long x){
|
|
segUnlazy(p, i, j);
|
|
if(i > r || j < l) return;
|
|
|
|
if(i >= l && j <= r){
|
|
seglazy[p] += x;
|
|
segUnlazy(p, i, j);
|
|
return;
|
|
}
|
|
|
|
int m = (i+j)/2;
|
|
segUpdate(p*2, i, m, l, r, x);
|
|
segUpdate(p*2+1, m+1, j, l, r, x);
|
|
segtree[p] = segtree[p*2] + segtree[p*2+1];
|
|
}
|
|
|
|
int segQuery(int p, int i, int j, int l, int r){
|
|
segUnlazy(p, i, j);
|
|
|
|
if(i > r || j < l) return 0;
|
|
if(i >= l && j <= r) return segtree[p];
|
|
int m = (i+j)/2;
|
|
return segQuery(p*2, i, m, l, r) + segQuery(p*2+1, m+1, j, l, r);
|
|
}
|
|
|
|
auto main() -> signed{
|
|
ios::sync_with_stdio(false);
|
|
|
|
int qct, n,c, t,p,q;
|
|
long long x;
|
|
|
|
cin >> qct;
|
|
while(qct--){
|
|
cin >> n >> c;
|
|
segtree.assign(n*4, 0); seglazy.assign(n*4, 0);
|
|
while(c--){
|
|
cin >> t >> p >> q;
|
|
p--, q--;
|
|
if(p > q) swap(p,q);
|
|
if(t == 0){
|
|
cin >> x;
|
|
segUpdate(1, 0, n-1, p, q, x);
|
|
}else{
|
|
cout << segQuery(1, 0, n-1, p, q) << '\n';
|
|
}
|
|
}
|
|
}
|
|
|
|
return 0;
|
|
} |