Codeforces Round #427 (Div. 2) C （前缀和思想）

Codeforces Round #427 (Div. 2) C （前缀和思想）

C. Star sky
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output

The Cartesian coordinate system is set in the sky. There you can see n stars, the i-th has coordinates (xi, yi), a maximum brightness c, equal for all stars, and an initial brightness si (0 ≤ si ≤ c).
Over time the stars twinkle. At moment 0 the i-th star has brightness si. Let at moment t some star has brightness x. Then at moment (t + 1) this star will have brightness x + 1, if x + 1 ≤ c, and 0, otherwise.
You want to look at the sky q times. In the i-th time you will look at the moment ti and you will see a rectangle with sides parallel to the coordinate axes, the lower left corner has coordinates (x1i, y1i) and the upper right — (x2i, y2i). For each view, you want to know the total brightness of the stars lying in the viewed rectangle.
A star lies in a rectangle if it lies on its border or lies strictly inside it.
Input
The first line contains three integers n, q, c (1 ≤ n, q ≤ 105, 1 ≤ c ≤ 10) — the number of the stars, the number of the views and the maximum brightness of the stars.
The next n lines contain the stars description. The i-th from these lines contains three integers xi, yi, si (1 ≤ xi, yi ≤ 100, 0 ≤ si ≤ c ≤ 10) — the coordinates of i-th star and its initial brightness.
The next q lines contain the views description. The i-th from these lines contains five integers ti, x1i, y1i, x2i, y2i (0 ≤ ti ≤ 109, 1 ≤ x1i < x2i ≤ 100, 1 ≤ y1i < y2i ≤ 100) — the moment of the i-th view and the coordinates of the viewed rectangle.
Output
For each view print the total brightness of the viewed stars.
Examples
input
2 3 3
1 1 1
3 2 0
2 1 1 2 2
0 2 1 4 5
5 1 1 5 5
output
3
0
3
input
3 4 5
1 1 2
2 3 0
3 3 1
0 1 1 100 100
1 2 2 4 4
2 2 1 4 7
1 50 50 51 51
output
3
3
5
0
Note
Let’s consider the first example.
At the first view, you can see only the first star. At moment 2 its brightness is 3, so the answer is 3.
At the second view, you can see only the second star. At moment 0 its brightness is 0, so the answer is 0.
At the third view, you can see both stars. At moment 5 brightness of the first is 2, and brightness of the second is 1, so the answer is 3.

题意：就是说在一个二维平面内有n个星星，每个星星有一个初始亮度为s，每过一秒数值增加1，数值不超过c，当超过c时数值变为0，然后再次循环。询问q次，每次询问在t时刻从（x1,y1）到 (x2,y2) 的区域所有点的数值总和是多少。

解题思路： 前缀和思想。f[k][i][j] 为在 x = i 轴上 y = j 之前初始亮度为 k 的星星的个数。经过了 t 时间，初始亮度为 k 的星星亮度为:
tot = (t + k) % (c + 1)

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<map>
#include<queue>
#include<stack>
#include<iostream>
#include<vector>
using namespace std;

const int maxn = 105;
int f[11][maxn][maxn];
int n,q,c;

void Init(){
    for(int s = 0;s <= c;s++){
        for(int x = 1;x <= 100;x++){
            for(int y = 1;y <= 100;y++){
                f[s][x][y] += f[s][x][y -1];
            }
        }
    }
}

int main(){
    int x,y,s,t,x1,y1,x2,y2;
    scanf("%d %d %d",&n,&q,&c);
    for(int i = 1;i <= n;i++){
        scanf("%d %d %d",&x,&y,&s);
        f[s][x][y]++;
    }
    Init();
    for(int i = 1;i <= q;i++){
        long long sum = 0;
        scanf("%d %d %d %d %d",&t,&x1,&y1,&x2,&y2);
        for(int j = x1;j <= x2;j++){
            for(int k = 0;k <= c;k++){
                int tot = (t + k) % (c + 1);//算有循环的数 (当前的数 + t次后) % (循环周期) = 要求的数。
                sum += 1LL * (f[k][j][y2] - f[k][j][y1 - 1]) * tot;
            }
        }
        printf("%I64d\n",sum);
    }
}