【COCI2015】bzoj3881 Divljak

首先把S集合建出来AC自动机，每在T中加入一个字符串，就把经过的所有节点和他们的fail指针打上+1标记。这一个操作可以在fail树上完成，需要用树状数组维护dfs序，把路径修改、单点查询变成单点修改、子树查询。询问的时候只需要询问这个字符串末尾对应的节点。

#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
const int maxn=2000010;
char s[maxn];
vector<int> son[maxn];
int trans[maxn][30],fail[maxn],L[maxn],R[maxn],a[maxn],
sum[maxn],pos[maxn],id[maxn],que[maxn],dep[maxn],mn[maxn*2][25],log[maxn*2],
tot,n,cdfs,ceul;
int cmpp(int x,int y)
{
    return L[x]<L[y];
}
int cmpd(int x,int y)
{
    return dep[x]<dep[y];
}
void dfs(int u)
{
    L[u]=++cdfs;
    mn[pos[u]=++ceul][0]=u;
    for (vector<int>::iterator it=son[u].begin();it!=son[u].end();it++)
    {
        dep[*it]=dep[u]+1;
        dfs(*it);
        mn[++ceul][0]=u;
    }
    R[u]=cdfs;
}
int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int l,p,hd=1,tl=0,u,q,opt,x,y,ans;
    scanf("%d",&n);
    for (int i=1;i<=n;i++)
    {
        scanf("%s",s+1);
        l=strlen(s+1);
        p=0;
        for (int j=1;j<=l;j++)
        {
            if (!trans[p][s[j]-'a']) trans[p][s[j]-'a']=++tot;
            p=trans[p][s[j]-'a'];
        }
        id[i]=p;
    }
    for (int i=0;i<26;i++)
        if (trans[0][i]) que[++tl]=trans[0][i];
    while (hd<=tl)
    {
        u=que[hd++];
        for (int i=0;i<26;i++)
            if (trans[u][i])
            {
                que[++tl]=trans[u][i];
                fail[trans[u][i]]=trans[fail[u]][i];
            }
            else trans[u][i]=trans[fail[u]][i];
    }
    for (int i=1;i<=tot;i++) son[fail[i]].push_back(i);
    dfs(0);
    for (int k=1;(1<<k)<=ceul;k++) log[1<<k]=k;
    for (int i=3;i<=ceul;i++)
        if (!log[i]) log[i]=log[i-1];
    for (int k=1;k<=log[ceul];k++)
        for (int i=1;i+(1<<k)-1<=ceul;i++)
            mn[i][k]=min(mn[i][k-1],mn[i+(1<<k-1)][k-1],cmpd);
    scanf("%d",&q);
    while (q--)
    {
        scanf("%d",&opt);
        if (opt==1)
        {
            scanf("%s",s+1);
            l=strlen(s+1);
            p=0;
            for (int i=1;i<=l;i++) a[i]=p=trans[p][s[i]-'a'];
            sort(a+1,a+l+1,cmpp);
            for (int i=1;i<=l;i++)
                for (int k=L[a[i]];k<=tot+1;k+=k&-k)
                    sum[k]++;
            for (int i=1;i<l;i++)
            {
                x=log[pos[a[i+1]]-pos[a[i]]];
                y=min(mn[pos[a[i]]][x],mn[pos[a[i+1]]-(1<<x)+1][x],cmpd);
                for (int k=L[y];k<=tot+1;k+=k&-k) sum[k]--;
            }
        }
        else
        {
            scanf("%d",&x);
            ans=0;
            for (int k=R[id[x]];k;k-=k&-k) ans+=sum[k];
            for (int k=L[id[x]]-1;k;k-=k&-k) ans-=sum[k];
            printf("%d\n",ans);
        }
    }
}