BZOJ3132 上帝造题的七分钟

二维树状数组。。。

就是要记一堆东西，不想详细描述了233

我去。。。多打了个分号调了1h。。。蒟蒻给跪了。。。

快嘲笑蒟蒻！！！

/**************************************************************
    Problem: 3132
    User: rausen
    Language: C++
    Result: Accepted
    Time:16372 ms
    Memory:66796 kb
****************************************************************/
 
#include <cstdio>
 
#define lowbit(p) p & -p
using namespace std;
const int N = 2055;
 
int n, m, del;
struct BIT {
    int t[N][N];
     
    inline void add(int x, int y, int del) {
        int Y;
        for (; x <= n; x += lowbit(x))
            for (Y = y; Y <= m; Y += lowbit(Y))
                t[x][Y] += del;
    }
     
    inline int sum(int x, int y) {
        int Y, res = 0;
        for (; x; x -= lowbit(x))
            for (Y = y; Y; Y -= lowbit(Y))
                res += t[x][Y];
        return res;
    }
} b1, b2, b3, b4;
 
inline void update(int x, int y) {
    if (!x || !y) return;
    b1.add(x, y, x * y * del);
    b2.add(x, 1, x * del), b2.add(x, y, -x * del);
    b3.add(1, y, y * del), b3.add(x, y, -y * del);
    b4.add(1, 1, del), b4.add(x, y, del);
    b4.add(x, 1, -del), b4.add(1, y, -del);
}
 
inline int query(int x, int y) {
    return b1.sum(x, y) + b2.sum(x, y) * y + b3.sum(x, y) * x + b4.sum(x, y) * x * y;
}
 
int main() {
    char oper;
    int x1, x2, y1, y2;
    scanf(" %*c%d%d
", &n, &m);
    while (scanf(" %c%d%d%d%d", &oper, &x1, &y1, &x2, &y2) != EOF) {
        if (oper == 'L') {
            scanf("%d", &del);
            update(x2, y2), update(x1 - 1, y1 - 1);
            del = -del;
            update(x2, y1 - 1), update(x1 - 1, y2);
        } else
        printf("%d
", query(x2, y2) + query(x1 - 1, y1 - 1) - query(x2, y1 - 1) - query(x1 - 1, y2));
    }
    return 0;
}