浅谈 acm中前缀和的应用

小技巧 ：int 用 signed 替换
树状数组区间更新做法：https://www.nowcoder.com/discuss/87630?type=101
树状数组前缀和做法 https://blog.csdn.net/weixin_41156591/article/details/81150890
随机化：https://www.nowcoder.com/discuss/87562?type=101&order=0&pos=15&page=0
纯前缀和做法：

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e6+10;
int n,m,i,j,T,X1,X2,Y1,Y2,k,x;
vector<int> mp[N],sum[N];
int ran[N],die;
signed main()
{
    srand(233);
    scanf("%lld%lld%lld",&n,&m,&T);
    for(i=0;i<=n+1;i++)for(j=0;j<=m+1;j++)sum[i].push_back(0),mp[i].push_back(0);
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        scanf("%lld",&x),mp[i][j]=x,ran[(i-1)*m+j]=(rand()<<16)+rand();
    }
    for(i=1;i<=T;i++)
    {
        scanf("%lld%lld%lld%lld%lld",&X1,&Y1,&X2,&Y2,&k);
        sum[X1][Y1]+=ran[k];
        sum[X2+1][Y1]-=ran[k];
        sum[X1][Y2+1]-=ran[k];
        sum[X2+1][Y2+1]+=ran[k];
    }
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            sum[i][j]+=sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1];
            if(sum[i][j]%ran[mp[i][j]])die++;
        }
    }
    printf("%lld",die);
    return 0;
}