P5357 【模板】AC自动机（二次加强版）（树上差分+AC自动机）

#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first                                  
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=2e5+10;
const int maxm=1e4+10;
const ll INF=1e18;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
int trie[maxn][26],fail[maxn],vis[maxn],cnt=0,n,mp[maxn];
string s[maxn],ss;
vector<int> g[maxn];
void insert(int x){
    int now=0;
    rep(i,0,s[x].size()){
        int tmp=s[x][i]-'a';
        if(!trie[now][tmp]) trie[now][tmp]=++cnt;
        now=trie[now][tmp];
        vis[now]=0;
    }
    mp[x]=now;
}
queue<int> q;
void bfs(){
    while(!q.empty()) q.pop();
    rep(i,0,26) if(trie[0][i]){
        q.push(trie[0][i]);
        fail[trie[0][i]]=0;
        g[0].push_back(trie[0][i]);
    }
    while(!q.empty()){
        int tp=q.front();q.pop();
        rep(i,0,26){
            if(trie[tp][i]){
                fail[trie[tp][i]]=trie[fail[tp]][i];
                q.push(trie[tp][i]);
                g[trie[fail[tp]][i]].push_back(trie[tp][i]);
            }else trie[tp][i]=trie[fail[tp]][i];
        }
    }
}
int ans=0;
void query(){
    int cur=0;
    rep(i,0,ss.size()){
        int tmp=ss[i]-'a';
        cur=trie[cur][tmp];
        vis[cur]++;
    }
}
void dfs(int x){
    for(auto v:g[x]){ 
        dfs(v);
        vis[x]+=vis[v];
    }
}

int main(){/*
    freopen("d://in.txt","r",stdin);
    freopen("d://out.txt","w",stdout);*/
    cin>>n;
    rep(i,0,n){
        cin>>s[i];
        insert(i);
    }
    bfs();
    cin>>ss;
    query(),dfs(0);
    rep(i,0,n) cout<<vis[mp[i]]<<"\n";
    return 0;
}