E. Garlands
题意:
一个
n∗m(<=2000∗2000)
的矩阵上,给出
k(<=2000)
条链,每条链长度
len(<=2000)
,保证相邻两个的四边有一边相临,链上有个开关,初始所有链为开,开的时候链上每个点有权值,关的时候权值为
0
。
然后有
- SWITCH i,按第i条链的开关,开变关,关变开
- ASK x1,y1,x2,y2,查询以x1,y1为左上,x2,y2为右下的矩阵的权值,这个操作总数不超过2000
思路:
离线,每条链分开处理,矩阵用二维树状数组维护,依次把第
i
条链的权值加进去,这一步是
#include<stdio.h>
typedef long long ll;
const int N = 2005;
ll tree[N][N];
void update(int pos1, int pos2, ll val){
for(; pos1 < N; pos1 += pos1&-pos1){
for(int pos = pos2; pos < N; pos += pos&-pos){
tree[pos1][pos] += val;
}
}
}
ll getsum(int pos1, int pos2){
ll res = 0;
for(; pos1; pos1 -= pos1&-pos1){
for(int pos = pos2; pos; pos -= pos&-pos){
res += tree[pos1][pos];
}
}
return res;
}
int x[N][N], y[N][N], w[N][N];
int len[N];
bool st[N];
int X1[N], Y1[N], X2[N], Y2[N], qcnt = 1;
int swc[1000006] = {0};
ll ans[N][N];
char str[10];
int main(){
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
for(int i = 1; i <= k; ++i){
scanf("%d", &len[i]);
for(int j = 0; j < len[i]; ++j){
scanf("%d%d%d", &x[i][j], &y[i][j], &w[i][j]);
}
}
int q;
scanf("%d", &q);
for(int i = 1; i <= q; ++i){
scanf("%s", str);
if(str[0] == 'S') scanf("%d", &swc[i]);
else{
scanf("%d%d%d%d", &X1[qcnt], &Y1[qcnt], &X2[qcnt], &Y2[qcnt]);
qcnt++;
}
}
for(int i = 1; i <= k; ++i){
for(int j = 0; j < len[i]; ++j) update(y[i][j], x[i][j], w[i][j]);
for(int j = 1; j < qcnt; ++j){
ans[i][j] = getsum(Y2[j], X2[j])-getsum(Y2[j], X1[j]-1)-getsum(Y1[j]-1, X2[j])+getsum(Y1[j]-1,X1[j]-1);
}
for(int j = 0; j < len[i]; ++j) update(y[i][j], x[i][j], -w[i][j]);
}
for(int i = 1, cnt = 1; i <= q; ++i){
if(swc[i]) st[swc[i]] ^= 1;
else{
ll tmp = 0;
for(int j = 1; j <= k; ++j){
if(!st[j]) tmp += ans[j][cnt];
}
cnt++;
printf("%lld\n", tmp);
}
}
}