无法下载数据。。。只能用悲剧来形容

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<cmath>
#include<queue>
#include<vector>
#include<map>
#include<cstring>

#define fast ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ll long long
#define endl "\n"
#define pii pair<int,int>
#define pb push_back
#define debug(x) cout << "visit:" << x << endl
#define inf 2147483647

using namespace std;

const int char_set = 26;
const int N = 2e6+5;

struct Trie
{
	int son[char_set], fail, flag;
}trie[N];
int cnt[N]={0};
int k = 1;

int n;
string s[151];

void insert(string s)
{
	int u=1;//与裸的字典树不同，需要留结点0作为停止结点 
	int len = s.size();
	for(int i=0;i<len;++i)
	{
		int v = s[i]-'a';
		if(!trie[u].son[v])
		{
			trie[u].son[v] = ++k;
		}
		u = trie[u].son[v];
	}
    cnt[u]++;
}

void getFail()
{
	for(int i=0;i<26;++i)//结点0是停止结点，而非根节点
	{
		trie[0].son[i] = 1;
	}
	queue<int> q;
	q.push(1);//从根节点开始遍历
	trie[1].fail = 0;
	while(q.size()>0)
	{
		int u = q.front();
		q.pop();
		for(int i=0;i<26;++i)
		{
			int v = trie[u].son[i];
			int Fail = trie[u].fail;
			if(!v)//该边不存在
			{//无法拓展该后缀,于是指向其fail的i
				trie[u].son[i] = trie[Fail].son[i];
				continue;
			}
			trie[v].fail = trie[Fail].son[i];
            //将trie[v]的fail指针赋值为   trie[fail[u]][i]
			q.push(v);
		}
	 } 
}

int query(string s)
{
	int u = 1, ans = 0;
	int len = s.size();
	for(int i=0;i<len;++i)
	{
		int v = s[i]-'a';
		int f = trie[u].son[v];
		while(f>1&&cnt[f]!=-1)
		{
			ans += cnt[f];
            cnt[f] = -1;
			f = trie[f].fail;
		}
		u = trie[u].son[v];
	}
	return ans;
}

void solve()
{
	for(int i=0;i<=k;++i)
	{
		memset(trie[i].son,0,sizeof(trie[i].son));
		trie[i].fail = trie[i].flag = cnt[i] = 0;
	}
	k = 1;
	for(int i=1;i<=n;++i)
	{
		cin >> s[i];
		insert(s[i]);
	}
	getFail();
	string t;
	cin >> t;
	cout << query(t) << endl;
}

int main()
{
	fast;
	cin >> n;
	solve();
	return 0;
}