AcWing 1282. Search Keyword Problem Solution ((AC Automata) Trie+KMP)+bfs)

AcWing 1282. 搜索关键词(（AC自动机）Trie+KMP）+bfs)
An algorithm that I wanted to learn a long time ago,But I didn't understand it before,Good thing I got it this time
希望ACAutomata can help meAC吧

#include<bits/stdc++.h>

using namespace std;

const int N = 1e4 + 10, S = 55;

int cnt[N * S], tr[N * S][26], ne[N * S];
int n, T, ids;
int q[N * S];
string str;

void insert(){
    
	int p = 0;
	for(int i = 0; str[i]; i ++ ){
    
		int t = str[i] - 'a';
		if(!tr[p][t]) tr[p][t] = ++ ids;
		p = tr[p][t];
	}
	cnt[p] ++ ;
}

void build(){
    
	int hh = 0, tt = -1;
	for(int i = 0; i < 26; i ++ ){
    
		if(tr[0][i]) q[ ++ tt] = tr[0][i];
	}
	
	while(hh <= tt){
    
		int t = q[hh ++ ];
		
		for(int i = 0; i < 26; i ++ ){
    
			int p = tr[t][i];
			if(!p) tr[t][i] = tr[ne[t]][i];
			else{
    
				ne[p] = tr[ne[t]][i];
				q[ ++ tt] = p;
			}
		}
	}
}

int main()
{
    
	cin>>T;
	while(T -- ){
    
		cin>>n;
		memset(cnt, 0, sizeof cnt);
		memset(ne, 0, sizeof ne);
		memset(tr, 0, sizeof tr);
		ids = 0;
		int res = 0;
		
		for(int i = 0; i < n; i ++ ){
    
			cin>>str;
			insert();
		}
		
		build();
		
		cin>>str;
		for(int i = 0, j = 0; str[i]; i ++ ){
    
			int t = str[i] - 'a';
			
			j = tr[j][t];  //代表从j节点连到tbranch of node,j是从根节点开始
			int p = j;
			while(p){
    
				res += cnt[p];
				cnt[p] = 0;
				p = ne[p];
			}
		} 
		cout<<res<<endl;
	}
	return 0;
}