题目
Code
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
using namespace std;
const int N=2e6;
int endpos[N],tr[N][30],fail[N],ans,tot,m,n;
char a[N],s[N];
inline void read(char *c){scanf("%s",c+1);n=strlen(c+1);}
void insert(int x,int pos){
if(pos>n){endpos[x]++;return;}
int c=a[pos]-'a';
if(!tr[x][c])tr[x][c]=++tot;
insert(tr[x][c],pos+1);
}
void AC(){
queue<int> q; rep(i,0,25)if(tr[0][i])q.push(tr[0][i]);
while(q.size()){
int x=q.front();q.pop();
rep(i,0,25)if(tr[x][i]){
fail[tr[x][i]]=tr[fail[x]][i];
q.push(tr[x][i]);
}else tr[x][i]=tr[fail[x]][i];
}
}
void query(int x,int pos){
if(pos>n)return;
int c=s[pos]-'a',now=tr[x][c];
for(int t=now;t&&endpos[t]!=-1;t=fail[t])
ans+=endpos[t],endpos[t]=-1;
query(now,pos+1);
}
int main()
{
scanf("%d",&m);
rep(i,1,m)read(a),insert(0,1);
AC(); read(s); query(0,1);
printf("%d\n",ans);
return 0;
}