【bzoj4542】[Hnoi2016]大数

 #include<algorithm>
 #include<iostream>
 #include<cstdlib>
 #include<cstring>
 #include<cstdio>
 #include<cmath>
 using namespace std;

 typedef long long LL;

 #define N 100010

 struct Node
 {
     LL val;
     int id;
 }md[N];

 struct data
 {
     int l,r,id;
 }ask[N];

 char s[N];

 LL c[N],d[N],h[N];
 LL a[N];

 LL p;
 int m,n;
 int l,r;

 int len,K;

 int cmp(Node aa,Node bb)
 {
     return aa.val<bb.val;
 }

 int cmp2(data aa,data bb)
 {
     return aa.l/K==bb.l/K ? aa.r<bb.r : aa.l<bb.l;
 }

 void work()
 {
     for (int i=;i<=len;i++)
     {
         d[i]=d[i-]+((s[i-]-'')%p ?  : i);
         c[i]=c[i-]+((s[i-]-'')%p==);
     }
     scanf("%d",&m);
     while (m--)
     {
         scanf("%d%d",&l,&r);
         printf("%lld\n",d[r]-d[l-]-(c[r]-c[l-])*(l-));
     }
 }

 int main()
 {
     scanf("%lld",&p);
     scanf("%s",s);
     len=strlen(s);
     K=sqrt(len)+;
     if (p== || p==)
     {
         work();
         return ;
     }
     LL res=;
     for (int i=len-;i>=;i--)
     {
         md[i].val=(md[i+].val+(s[i]-'')*res)%p;
         md[i].id=i;
         res=res*%p;
     }
     md[len].id=len;
     sort(md,md+len+,cmp);
     res=;
     for (int i=;i<=len;i++)
     {
         if (i && md[i].val!=md[i-].val)
             res++;
         h[md[i].id]=res;
     }
     scanf("%d",&m);
     for (int i=;i<=m;i++)
     {
         scanf("%d%d",&ask[i].l,&ask[i].r);
         ask[i].l--;
         ask[i].id=i;
     }
     sort(ask,ask+m,cmp2);
     int L(),R(-);
     res=;
     for (int i=;i<m;i++)
     {
         while (R<ask[i].r)
             res+=c[h[++R]]++;
         while (R>ask[i].r)
             res-=--c[h[R--]];
         while (L>ask[i].l)
             res+=c[h[--L]]++;
         while (L<ask[i].l)
             res-=--c[h[L++]];
         a[ask[i].id]=res;
     }
     for (int i=;i<m;i++)
         printf("%lld\n",a[i]);
     return ;
 }