Luogu 4514 上帝造题的七分钟

二维差分+树状数组。

定义差分数组$d_{i, j} = a_{i, j} + a_{i - 1, j - 1} - a_{i, j - 1} - a_{i - 1, j}$，有$a_{i, j} = \sum_{x = 1}^{i}\sum_{y = 1}^{j}d_{i, j}$。

我们要求$sum(n, m) = \sum_{i = 1}^{n}\sum_{j = 1}^{m}a_{i, j} $，

代入$a_{i, j}$，得$sum(n, m) = \sum_{i = 1}^{n}\sum_{j = 1}^{m}\sum_{x = 1}^{i}\sum_{y = 1}^{j}d_{x, y}$。

列一下发现$d_{x, y}$出现了$(n - x + 1) * (m - y + 1)$次。

那么$sum(n, m) = \sum_{i = 1}^{n}\sum_{j = 1}^{m}d_{i, j} * (n - i + 1) * (m - j + 1)$。

把$(n + 1),(m + 1),i, j$看作四项展开，得到$(n + 1) * (m + 1)\sum_{i = 1}^{n}\sum_{j = 1}^{m}d_{i, j} + \sum_{i = 1}^{n}\sum_{j = 1}^{m}d_{i, j} * i * j - (m + 1)  \sum_{i = 1}^{n}\sum_{j = 1}^{m}d_{i, j} * i - (n + 1)\sum_{i = 1}^{n}\sum_{j = 1}^{m}d_{i, j} * j$。

两个$\sum$可以用一个二维树状数组维护，这样子维护四个树状数组即可（修改好长）。

时间复杂度$O(qlognlogm)$。

另外，longlong在Luogu上会MLE最后两个点，要用int

Code：

#include <cstdio>
#include <cstring>
using namespace std;
typedef int ll;

const int N = ;

int n, m;

template <typename T>
inline void read(T &X) {
    X = ; char ch = ; T op = ;
    for(; ch > ''|| ch < ''; ch = getchar())
        if(ch == '-') op = -;
    for(; ch >= '' && ch <= ''; ch = getchar())
        X = (X << ) + (X << ) + ch - ;
    X *= op;
}

struct BinaryIndexTree {
    ll arr[N][N];

    #define lowbit(p) (p & (-p))

    inline void modify(int x, int y, ll v) {
        for(int i = x; i <= n; i += lowbit(i))
            for(int j = y; j <= m; j += lowbit(j))
                arr[i][j] += v;
    }

    inline ll query(int x, int y) {
        ll res = 0LL;
        for(int i = x; i > ; i -= lowbit(i))
            for(int j = y; j > ; j -= lowbit(j))
                res += arr[i][j];
        return res;
    }

} sum, mulij, muli, mulj;

inline int min(int x, int y) {
    return x > y ? y : x;
}

inline int max(int x, int y) {
    return x > y ? x : y;
}

inline ll qSum(int x, int y) {
    return 1LL * (x + ) * (y + ) * sum.query(x, y) + 1LL * mulij.query(x, y)
        - 1LL * (y + ) * muli.query(x, y) - 1LL * (x + ) * mulj.query(x, y);
}

int main() {
//    freopen("Sample.txt", "r", stdin);

    char op = getchar();
    read(n), read(m);
    for(; ; ) {
        for(op = getchar(); op != 'L' && op != 'k' && op >= ; op = getchar());
        if(op < ) break;

        if(op == 'L') {
            int a, b, c, d; ll v;
            read(a), read(b), read(c), read(d), read(v);
            int lx = min(a, c), ly = min(b, d), rx = max(a, c), ry = max(b, d);
            sum.modify(lx, ly, v);
            sum.modify(rx + , ry + , v);
            sum.modify(lx, ry + , -v);
            sum.modify(rx + , ly, -v);

            muli.modify(lx, ly, v * lx);
            muli.modify(rx + , ry + , v * (rx + ));
            muli.modify(lx, ry + , -v * lx);
            muli.modify(rx + , ly, -v * (rx + ));

            mulj.modify(lx, ly, v * ly);
            mulj.modify(rx + , ry + , v * (ry + ));
            mulj.modify(lx, ry + , -v * (ry + ));
            mulj.modify(rx + , ly, -v * ly);

            mulij.modify(lx, ly, v * lx * ly);
            mulij.modify(rx + , ry + , v * (rx + ) * (ry + ));
            mulij.modify(lx, ry + , -v * (ry + ) * lx);
            mulij.modify(rx + , ly, -v * (rx + ) * ly);
        } else {
            int a, b, c, d;
            read(a), read(b), read(c), read(d);
            int lx = min(a, c), ly = min(b, d), rx = max(a, c), ry = max(b, d);
            printf("%d\n", qSum(rx, ry) + qSum(lx - , ly - ) - qSum(rx, ly - ) - qSum(lx - , ry));
        }
    }
    return ;
}