CodeForces - 835C Star sky(预处理加二维处理)

补题第一发..
这题第一眼见到完全不会做啊,然后就算在比赛中百度了看到说是dp,然而也完全没有思路,就没有尝试了.
是一个所谓的预处理吧,因为星星的亮度是周期性变化的,所有只要处理最多1~10的情况就好了.
还有,这根本跟dp没关系啊,不就一个简单容斥嘛.(画个图就很好理解了,注意方框的边缘的处理,要减一)

/*  xzppp  */
#include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <algorithm>
#include <stdio.h>
#include <string.h>
#include <list>
using namespace std;
#define FFF freopen("in.txt","r",stdin);freopen("out.txt","w",stdout);
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define mp make_pair
const int MAXN = 100000;
const int INF = 0x7ffffff;
const int MOD = 1e9+7;
typedef long long  LL;
typedef unsigned long long ULL;
struct star
{
    int x,y,s;
}all[MAXN+17];
int dp[100+17][100+17][10+17];
int main()
{
    int n,q,c;
    scanf("%d%d%d",&n,&q,&c);
    for (int i = 0; i < n; ++i) 
        scanf("%d%d%d",&all[i].x,&all[i].y,&all[i].s);
    for (int i = 0; i <= c; ++i)
    {
        for (int j = 0; j < n; ++j) 
        {
            dp[all[j].x][all[j].y][i] += all[j].s;
            (++all[j].s)%=(c+1);
        }
        for (int j = 1; j <=100 ; ++j)
            for(int k=1;k<=100;++k)
            dp[j][k][i] += dp[j-1][k][i] + dp[j][k-1][i] - dp[j-1][k-1][i];         
    }
    for (int i = 0; i < q; ++i)
    {
        int a,b,x,d,e;
        scanf("%d%d%d%d%d",&a,&b,&x,&d,&e);
        a%=(c+1);
        LL ans = dp[d][e][a] - dp[d][x-1][a] -dp[b-1][e][a] + dp[b-1][x-1][a];
        printf("%lld\n",ans);
    }
    return 0;
}