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

传送门

差分+暴力

 #include<cstdio>
 #include<cstdlib>
 #include<algorithm>
 #include<cstring>
 #define MAXN 80005
 #define ll long long
 using namespace std;
 ll read(){
     ll x=,f=;char ch=getchar();
     while(ch<''||ch>''){if('-'==ch)f=-;ch=getchar();}
     while(ch>=''&&ch<=''){x=x*+(ch^);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[]={};
     while(T--){
         scanf("%s",ch);
         int l=read(),r=read();
         if('A'==ch[]){
             int x=read();
             a[l]+=x,a[r+]-=x;
         }
         else{
             for(int i=;i<=n;i++){
                 b[i]=a[i]+b[i-];
             }
             int ans=;
             for(int i=l;i<=r;i++){
                 int t=b[i]%MOD*i%MOD;
                 if(minT<=t&&t<=maxT){
                     ans++;
                 }
             }
             printf("%d\n",ans);
         }
     }
     for(int i=;i<=n;i++){
         b[i]=a[i]+b[i-];
     }
     for(int i=;i<=n;i++){
         int t=b[i]%MOD*i%MOD;
         c[i]=c[i-]+(minT<=t&&t<=maxT);
     }
     T=read();
     while(T--){
         int l=read(),r=read();
         printf("%d\n",c[r]-c[l-]);
     }
     return ;
 }