萌新不是刚学OI，是可爱的男孩纸QWQ，请求大神帮助

#include <iostream>
#include <cstdio>
#include <string>
#include <queue>
using namespace std;
int n;
int trie[1000002][26],sz;
int cnt[1000002];
int nxt[1000002];
int ans;
string t;
void make_trie()
{
	int cur=1;
	int len=t.length();
	for (int i=0;i<len;i++)
	{
		if (!trie[cur][t[i]-'a'])
		{
			trie[cur][t[i]-'a']=++sz;
		}
		cur=trie[cur][t[i]-'a'];
	}
	cnt[cur]++;
	return;
}
void make_next()
{
	for (int i=0;i<26;i++)
		trie[0][i]=1;
	queue<int> q;
	q.push(1);
	nxt[1]=0;
	while (!q.empty())
	{
		int cur=q.front();
		for (int i=0;i<26;i++)
		{
			if (!trie[cur][i])
			{
				trie[cur][i]=trie[nxt[cur]][i];
			}
			else
			{
				q.push(trie[cur][i]);
				int cur_nxt=nxt[cur];
				while (cur_nxt&&!trie[cur_nxt][i])
					cur_nxt=nxt[cur_nxt];
				nxt[trie[cur][i]]=trie[cur_nxt][i];
			}
		}
	}
	return;
}
void aca()
{
	int cur=1;
	int len=t.length();
	for (int i=0;i<len;i++)
	{
		int cur_nxt=trie[cur][t[i]-'a'];
		while (cur_nxt>1)
		{
			ans+=cnt[cur_nxt];
			cur_nxt=nxt[cur_nxt];
		}
		cur=nxt[cur];
	}
	return;
}
int main()
{
	cin>>n;
	for (int i=1;i<=n;i++)
	{
		cin>>t;
		make_trie();
	}
	make_next();
	cin>>t;
	aca();
	cout<<ans<<endl;
	return 0;
}