传送门：【HDU】2222 Keywords Search

题目大意：给你多个模式串，问能在目标串中匹配多少个。

题目分析：
AC自动机模板题，因为忘记考虑模式串重复的问题差点成WA自动机= =||
注意本题搜过的就不用再搜一次了，反正都标记为0了

代码如下：

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std ;

#define REP( I , N ) for ( int I = 0 ; I < N ; ++ I )
#define CHARREP( I ) for ( int I = 0 ; buf[I] ; ++ I )
#define clear( A , X ) memset ( A , X , sizeof A )

const int maxW = 26 ;
const int maxN = 10005 ;
const int TIME = 55 ;
const int maxS = 1000005 ;
const int maxQ = 1000005 ;

struct Trie {
	int next[maxN * TIME][maxW] ;
	int fail[maxN * TIME] ;
	int end[maxN * TIME] ;
	int Q[maxQ] ;
	int head , tail ;
	int P , root ;
	bool vis[maxN * TIME] ;
	
	int New () {
		REP ( i , maxW ) next[P][i] = -1 ;
		end[P] = 0 ;
		return P ++ ;
	}//New
	
	void Init () {
		P = 0 ;
		root = New () ;
	}//Init
	
	void Insert ( char buf[] ) {
		int now = root ;
		CHARREP ( i ) {
			int x = buf[i] - 'a' ;
			if ( next[now][x] == -1 ) next[now][x] = New () ;
			now = next[now][x] ;
		}
		end[now] ++ ;
	}//Insert
	
	void Build () {
		head = tail = 0 ;
		fail[root] = root ;
		REP ( i , maxW ) {
			if ( next[root][i] == -1 ) next[root][i] = root ;
			else {
				fail[next[root][i]] = root ;
				Q[tail ++] = next[root][i] ;
			}
		}
		while ( head != tail ) {
			int now = Q[head ++] ;
			if ( head >= maxQ ) head -= maxQ ;
			REP ( i , maxW ) {
				if ( next[now][i] == -1 ) next[now][i] = next[fail[now]][i] ;
				else {
					fail[next[now][i]] = next[fail[now]][i] ;
					Q[tail ++] = next[now][i] ;
					if ( tail >= maxQ ) tail -= maxQ ;
				}
			}
		}
	}//Build
	
	void Query ( char buf[] ) {
		int now = root , res = 0 ;
		clear ( vis , 0 ) ;
		CHARREP ( i ) {
			now = next[now][buf[i] - 'a'] ;
			int tmp = now ;
			while ( tmp != root ) {
				if ( vis[tmp] ) break ;
				vis[tmp] = 1 ;
				res += end[tmp] ;
				tmp = fail[tmp] ;
			}
		}
		printf ( "%d\n" , res ) ;
	}//Query
} ;

Trie AC ;
char buf[maxS] ;

void Work () {
	int n ;
	AC.Init () ;
	scanf ( "%d" , &n ) ;
	REP ( i , n ) {
		scanf ( "%s" , buf ) ;
		AC.Insert ( buf ) ;
	}
	AC.Build () ;
	scanf ( "%s" , buf ) ;
	AC.Query ( buf ) ;
}//Work

int main () {
	int T ;
	scanf ( "%d" , &T ) ;
	while ( T -- ) Work () ;
	return 0 ;
}//main