CF427 C star sky 二维数组前缀和

用pre[t][i][j]存时间等价于t时坐标(1, 1) 和(i, j)组成的矩形区域的星星总亮度。再注意一下一个坐标处可以有多颗星星就可以了。

 star sky

// http://codeforces.com/contest/835/problem/C
#include <cstdio> 
#include <cstring>
const int M = 12, N = 102;
int pre[M][N][N];
int main()
{
    int n, q, c;
    while(~scanf("%d%d%d", &n, &q, &c)) {
        memset(pre, 0, sizeof pre);
        c++;
        int x, y, s;
        while(n--) {
            scanf("%d%d%d", &x, &y, &s);
            for (int i = 0; i < c; ++i)
                pre[i][x][y] += (s + i) % c; //不易注意的地方，同一个坐标可能有多颗小星星 
        }
        for (int t = 0; t < c; ++t) //时间t，求下二维前缀和 
            for (int i = 1; i <= 100; ++i)
                for (int j = 1; j <= 100; ++j)
                    pre[t][i][j] += pre[t][i-1][j] + pre[t][i][j-1] - pre[t][i-1][j-1];
        int t, x1, y1, x2, y2;
        while(q--) {
            scanf("%d%d%d%d%d", &t, &x1, &y1, &x2, &y2);
            t %= c;
            int sum = pre[t][x2][y2] - pre[t][x1-1][y2] - pre[t][x2][y1-1] + pre[t][x1-1][y1-1];
            printf("%d\n", sum); 
        }
    }
    
    return 0;
}