bzoj 4212 神牛的养成计划 -Trie

若可离线，此题可线性，可以三棵Trie一个log。

#include<bits/stdc++.h>
#define gc getchar()
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define Rep(i,v) rep(i,0,(int)v.size()-1)
#define rev(s,n) rep(qwqqwq,1,n/2) swap(s[qwqqwq],s[n-qwqqwq+1])
#define lint long long
#define db double
#define pb push_back
#define mp make_pair
#define fir first
#define sec second
#define N 2010
#define MXL 2000010
#define SIG 26
#define debug(x) cerr<<#x<<"="<<x
#define sp <<" "
#define ln <<endl
using namespace std;
typedef pair<int,int> pii;
typedef set<int>::iterator sit;
inline int inn()
{
    int x,ch;while((ch=gc)<'0'||ch>'9');
    x=ch^'0';while((ch=gc)>='0'&&ch<='9')
        x=(x<<1)+(x<<3)+(ch^'0');return x;
}
int *Lqwq;
inline bool cmp(pii a,pii b) { return Lqwq[a.fir]<Lqwq[b.fir]; }
struct Trie{
    int ch[MXL][SIG],L[MXL],sz[MXL],rt,node_cnt,dfc;
    Trie() { node_cnt=rt=1; }
    inline int ins(char *s,int n)
    {
        int x=rt;
        for(int i=1,c;i<=n;i++,x=ch[x][c])
            if(!ch[x][c=s[i]-'a']) ch[x][c]=++node_cnt;
        return sz[x]++,x;
    }
    int dfs(int x)
    {
        L[x]=dfc+1,dfc+=sz[x];
        rep(i,0,SIG-1) if(ch[x][i]) sz[x]+=dfs(ch[x][i]);
        return sz[x];
    }
    inline int solve(pii *a,int n,int *b)
    { dfs(rt);Lqwq=L;sort(a+1,a+n+1,cmp);rep(i,1,n) b[a[i].sec]=i;return 0; }
    inline int getLR(char *s,int n,int &l,int &r)
    {
        int x=rt;
        for(int i=1,c;i<=n;x=ch[x][c],i++)
            if(!ch[x][c=s[i]-'a']) return l=1,r=0;
        return l=L[x],r=L[x]+sz[x]-1;
    }
}t[2];
char s[MXL];pii xp[N],yp[N];int x[N],y[N],c[N][N];
inline int trs(char *s,int n,int c) { c%=26;rep(i,1,n) s[i]=(s[i]-'a'+c)%26+'a';return 0; }
int main()
{
    int n=inn();
    rep(i,1,n)
    {
        scanf("%s",s+1);int len=(int)strlen(s+1);
        xp[i].fir=t[0].ins(s,len);rev(s,len);
        yp[i].fir=t[1].ins(s,len);
        xp[i].sec=yp[i].sec=i;
    }
    t[0].solve(xp,n,x),t[1].solve(yp,n,y);
    rep(i,1,n) c[x[i]][y[i]]++;
    rep(i,1,n) rep(j,1,n) c[i][j]=c[i-1][j]+c[i][j-1]-c[i-1][j-1]+c[i][j];
    for(int q=inn(),las_ans=0;q;q--)
    {
        int l,r,a,b,len;
        scanf("%s",s+1),len=(int)strlen(s+1);
        trs(s,len,las_ans);t[0].getLR(s,len,l,r);
        scanf("%s",s+1);len=(int)strlen(s+1);rev(s,len);
        trs(s,len,las_ans);t[1].getLR(s,len,a,b);
        if(l>r||a>b) { printf("0\n");las_ans=0;continue; }
        printf("%d\n",las_ans=c[r][b]-c[l-1][b]-c[r][a-1]+c[l-1][a-1]);
    }
    return 0;
}