WISCO信息组NOIP模拟赛-数据结构

传送门

差分+暴力

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#define MAXN 80005
#define ll long long
using namespace std;
ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if('-'==ch)f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+(ch^48);ch=getchar();}
    return x*f;
}
ll a[MAXN],b[MAXN];
int c[MAXN];
int n,MOD,minT,maxT;
int main()
{
//    freopen("data.in","r",stdin);
    n=read();
    int T=read();
    MOD=read(),minT=read(),maxT=read();
    char ch[5]={0};
    while(T--){
        scanf("%s",ch);
        int l=read(),r=read();
        if('A'==ch[0]){
            int x=read();
            a[l]+=x,a[r+1]-=x;
        }
        else{
            for(int i=1;i<=n;i++){
                b[i]=a[i]+b[i-1];
            }
            int ans=0;
            for(int i=l;i<=r;i++){
                int t=b[i]%MOD*i%MOD;
                if(minT<=t&&t<=maxT){
                    ans++;
                }
            }
            printf("%d
",ans);
        }
    }
    for(int i=1;i<=n;i++){
        b[i]=a[i]+b[i-1];
    }
    for(int i=1;i<=n;i++){
        int t=b[i]%MOD*i%MOD;
        c[i]=c[i-1]+(minT<=t&&t<=maxT);
    }
    T=read();
    while(T--){
        int l=read(),r=read();
        printf("%d
",c[r]-c[l-1]);
    }
    return 0;
}