CSU-ACM2017暑期训练16-树状数组 F - Matrix Sum HihoCoder - 1336

F - Matrix Sum

You are given an N × N matrix. At the beginning every element is 0. Write a program supporting 2 operations:

 1. Add x y value: Add value to the element Axy. (Subscripts starts from 0

2. Sum x1 y1 x2 y1: Return the sum of every element Axy for x1 ≤ x ≤ x2, y1 ≤ y ≤ y2.

Input

The first line contains 2 integers N and M, the size of the matrix and the number of operations.

Each of the following M line contains an operation.

1 ≤ N ≤ 1000, 1 ≤ M ≤ 100000

For each Add operation: 0 ≤ x < N, 0 ≤ y < N, -1000000 ≤ value ≤ 1000000

For each Sum operation: 0 ≤ x1 ≤ x2 < N, 0 ≤ y1 ≤ y2 < N

Output

For each Sum operation output a non-negative number denoting the sum modulo 109+7.

Sample Input

5 8
Add 0 0 1
Sum 0 0 1 1
Add 1 1 1
Sum 0 0 1 1
Add 2 2 1
Add 3 3 1
Add 4 4 -1
Sum 0 0 4 4 

Sample Output

1
2
3 

套用二位树状数组的求和、更新函数进行模拟即可。注意输入的下标需要加一，以免对树状数组下标为零的元素进行操作。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
using namespace std;
const int MOD = 1e9+7, maxn = 1004;

int n, m;

int c[maxn][maxn], a[maxn][maxn];

void add(int x, int y, int d){
    for(int i = x; i <= n; i += i&-i)
        for(int j = y; j <= n; j += j&-j)
            c[i][j] = (c[i][j]+d) % MOD;
}

int sum(int x, int y){
    int ret = 0;
    for(int i = x; i > 0; i -= i&-i)
        for(int j = y; j > 0; j -= j&-j)
            ret = (ret+c[i][j]) % MOD;
    return ret;
}

int main(){
#ifdef TEST
freopen("test.txt", "r", stdin);
#endif // TEST

    char ord[4];
    int x, y, xx, yy, s;
    while(cin >> n >> m){
        memset(c, 0, sizeof(c));
        for(int i = 0; i < m; i++){
            scanf("%s", ord);
            if(*ord == 'A'){
                scanf("%d%d%d", &x, &y, &s);
                add(++x, ++y, s);
            }
            if(*ord == 'S'){
                int ans;
                scanf("%d%d%d%d", &x, &y, &xx, &yy);
                x++, y++, xx++, yy++;
                ans = ((sum(xx,yy) - sum(xx,y-1) - sum(x-1,yy) + sum(x-1,y-1))%MOD+MOD)%MOD;
                printf("%d\n",ans);
            }
        }
    }

    return 0;
}