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.
所有星星闪烁有一个长度为c+1的周期,也就意味着如果只考虑星星亮度的话就只有c+1种状态,这样每次查询时只要取ti%(c+1)就能找到对应的状态,其实这道题已经变得很简单了。
对所有的c+1种状态各自求一次二维前缀和,然后对于q轮查询二维区间和每次就都只有O(1)的复杂度了
所以时间复杂度为O(c*100*100)
1 #include <cstdio> 2 #include <cstring> 3 struct R{int t,x1,y1,x2,y2; 4 }r[100010]; 5 struct T{int x,y,s; 6 }t[100010]; 7 int n,x,q,c,f[11][101][101],g[101][101],ans; 8 int main() 9 { 10 memset(f,0,sizeof(f)); 11 scanf("%d%d%d",&n,&q,&c); 12 for (int i=1;i<=n;i++) scanf("%d%d%d",&t[i].x,&t[i].y,&t[i].s); 13 for (int i=1;i<=q;i++) scanf("%d%d%d%d%d",&r[i].t,&r[i].x1,&r[i].y1,&r[i].x2,&r[i].y2); 14 for (int i=0;i<=c;i++) 15 { 16 memset(g,0,sizeof(g)); 17 for (int j=1;j<=n;j++) 18 g[t[j].x][t[j].y]+=(t[j].s+i)%(c+1); 19 for (int j=1;j<=100;j++) 20 for (int k=1;k<=100;k++) 21 f[i][j][k]=g[j][k]+f[i][j-1][k]+f[i][j][k-1]-f[i][j-1][k-1]; 22 } 23 for (int i=1;i<=q;i++) 24 { 25 x=r[i].t%(c+1); 26 ans=f[x][r[i].x2][r[i].y2]-f[x][r[i].x1-1][r[i].y2]-f[x][r[i].x2][r[i].y1-1]+f[x][r[i].x1-1][r[i].y1-1]; 27 printf("%d\n",ans); 28 } 29 }