[莫队 分块] BZOJ 4866 [Ynoi2017]由乃的商场之旅

这个 只会莫队（分块？ 我分不清楚）乱搞 自己YY下
复杂度$O(n\sqrt{26*n})$
成功贴时限过加时间垫底

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;

inline char nc(){
  static char buf[100000],*p1=buf,*p2=buf;
  return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline void read(int &x){
  char c=nc(),b=1;
  for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
  for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}
inline void read(char *s){
  char c=nc(); int len=0;
  for (;!(c>='a' && c<='z');c=nc());
  for (;c>='a' && c<='z';s[++len]=c,c=nc());
}
inline void write(ll x){
  if (x>=10) write(x/10); putchar(x%10+'0');
}

const int N=60005;

unsigned short cnt[1<<26];

inline void add(int x){
  cnt[x]++;
  for (int i=0;i<26;i++) cnt[x^(1<<i)]++; 
}
inline void del(int x){
  cnt[x]--;
  for (int i=0;i<26;i++) cnt[x^(1<<i)]--; 
}
inline int query(int x){
  return cnt[x];
}

int n,m,pre[N];
char s[N];

int B,tot;
int lp[N],rp[N],pos[N];
ll num[N];

struct event{
  int l,r,idx;
  event(int l=0,int r=0,int idx=0):l(l),r(r),idx(idx) { }
  bool operator < (const event &B) const {
    return pos[l]==pos[B.l]?r<B.r:pos[l]<pos[B.l];
  }
}ev[N]; int _tot;
ll ans[N];

int main(){
  int _l,_r;
  freopen("t.in","r",stdin);
  freopen("t.out","w",stdout);
  read(n); read(m);
  read(s); pre[0]=0; for (int i=1;i<=n;i++) pre[i]=pre[i-1]^(1<<(s[i]-'a'));
  B=min((int)sqrt(n*26),n);
  //B=sqrt(n);
  for (int i=1;i<=n;i++) pos[i]=(i-1)/B+1; tot=pos[n];
  for (int i=1;i<=tot;i++) lp[i]=(i-1)*B+1,rp[i]=i*B; rp[tot]=n;
  for (int i=1;i<=tot;i++){
    add(pre[rp[i]]); ll cur=0;
    for (int j=rp[i]-1;j>=lp[i]-1;j--){
      num[j+1]=num[j+2]+query(pre[j]);
      add(pre[j]);
    }
    for (int j=rp[i];j>=lp[i]-1;j--) del(pre[j]);
  }
  for (int i=1;i<=m;i++){
    read(_l),read(_r);
    if (pos[_l]==pos[_r]){
      add(pre[_l-1]);
      for (int j=_l;j<=_r;j++)
    ans[i]+=query(pre[j]),add(pre[j]);
      for (int j=_l-1;j<=_r;j++) del(pre[j]);
    }else
      ev[++_tot]=event(_l,_r,i);
  }
  sort(ev+1,ev+_tot+1);
  int last=0,pnt=0;
  for (int i=1;i<tot;i++){
    last=pnt;
    while (pnt+1<=_tot && pos[ev[pnt+1].l]==i) pnt++;
    int r=lp[i+1]-1; ll cur=0;
    add(pre[lp[i+1]-1]);
    for (int j=last+1;j<=pnt;j++){
      while (r<ev[j].r) cur+=query(pre[++r]),add(pre[r]);
      ans[ev[j].idx]+=cur+num[ev[j].l];
      del(pre[lp[i+1]-1]);
      for (int k=ev[j].l-1;k<rp[i];k++)
    ans[ev[j].idx]+=query(pre[k]);
      add(pre[lp[i+1]-1]);
    }
    for (int j=lp[i+1]-1;j<=r;j++) del(pre[j]);
  }
  for (int i=1;i<=m;i++) write(ans[i]),putchar('\n');
  return 0;
}