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.
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.
For each view print the total brightness of the viewed stars.
2 3 3 1 1 1 3 2 0 2 1 1 2 2 0 2 1 4 5 5 1 1 5 5
3 0 3
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
3 3 5 0
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颗星星,每颗星星的坐标为(x,y)亮度为s,每颗星星每秒增加一个亮度但不超过c,若超过c则变为0。现在给定一个方形观察区域和时间,求这一时刻该区域星星的亮度之和
题解:dp[x][y][k]:代表(0,0)-(x,y)范围内亮度为k的星星数量。推倒dp数组方程:dp[i][j][k]=dp[i][j][k]+dp[i-1]dp[j][k]+dp[i][j-1][k]-dp[i-1][j-1][k]。最后访问时,给出的观察区域(x1,y1)-(x2,y2) 公式:ans=dp[x2][y2][k]-dp[x1-1][y2][k]-dp[x2][y1-1][k]+dp[x1-1][y1-1][k]。其实两个公式就是容斥的思想。
代码:
#include<bits/stdc++.h>
#define debug cout<<"aaa"<<endl
#define mem(a,b) memset(a,b,sizeof(a))
#define LL long long
#define lson l,mid,root<<1
#define rson mid+1,r,root<<1|1
#define MIN_INT (-2147483647-1)
#define MAX_INT 2147483647
#define MAX_LL 9223372036854775807i64
#define MIN_LL (-9223372036854775807i64-1)
using namespace std;
const int N = 100 + 5;
const int mod = 1000000000 + 7;
int dp[N][N][15];
int main(){
int n,q,c,x,y,x1,y1,x2,y2,t,s,ans,val;
mem(dp,0);
cin>>n>>q>>c;
for(int i=1;i<=n;i++){
cin>>x>>y>>s;
dp[x][y][s]++;
}
for(int i=1;i<N;i++){
for(int j=1;j<N;j++){
for(int k=0;k<=12;k++){
dp[i][j][k]+=dp[i-1][j][k]+dp[i][j-1][k]-dp[i-1][j-1][k];
}
}
}
while(q--){
cin>>t>>x1>>y1>>x2>>y2;
ans=0;
for(int i=0;i<=c;i++){
val=(i+t)%(c+1);
ans+=val*(dp[x2][y2][i]-dp[x2][y1-1][i]-dp[x1-1][y2][i]+dp[x1-1][y1-1][i]);
}
printf("%d\n",ans);
}
return 0;
}