传送门：【HDU】2896 病毒侵袭

题目分析：AC自动机模板题。PE了两发我会乱说QUQ。。。

代码如下：

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

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

const int maxW = 128 ;
const int maxN = 512 ;
const int maxS = 10005 ;

//==========================================================
struct Trie {
	int next[maxN << 8][maxW] ;
	int fail[maxN << 8] ;
	int end[maxN << 8] ;
	int Q[maxN << 8] ;
	bool vis[maxN] ;
	int head , tail ;
	int P , root ;
	
	int New () {
		REP ( i , maxW ) next[P][i] = -1 ;
		end[P] = -1 ;
		return P ++ ;
	}//New
	
	void Init () {
		P = 0 ;
		root = New () ;
	}//Init
	
	void Insert ( char buf[] , int idx ) {
		int now = root ;
		CHARREP ( i ) {
			if ( next[now][buf[i]] == -1 ) next[now][buf[i]] = New () ;
			now = next[now][buf[i]] ;
		}
		end[now] = idx ;
	}//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 ++] ;
			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] ;
				}
			}
		}
	}//Build
	
	int Query ( char buf[] , int n , int cas ) {
		int now = root ;
		clear ( vis , 0 ) ;
		CHARREP ( i ) {
			now = next[now][buf[i]] ;
			int tmp = now ;
			while ( tmp != root ) {
				if ( end[tmp] != -1 ) vis[end[tmp]] = 1 ;
				tmp = fail[tmp] ;
			}
		}
		int res = 0 , flag = 0 ;
		REP ( i , n ) if ( vis[i] ) {
			if ( !flag ) {
				printf ( "web %d:" , cas ) ;
				flag = 1 ;
			}
			++ res ;
			printf ( " %d" , i + 1 ) ;
		}
		if ( res ) printf ( "\n" ) ;
		return res ;
	}//Query
} ;
//==========================================================

Trie AC ;
char buf[maxS] ;

void Work () {
	int n , m ;
	while ( ~scanf ( "%d" , &n ) ) {
		AC.Init () ;
		REP ( i , n ) {
			scanf ( "%s" , buf ) ;
			AC.Insert ( buf , i ) ;
		}
		AC.Build () ;
		scanf ( "%d" , &m ) ;
		int res = 0 ;
		REP ( i , m ) {
			scanf ( "%s" , buf ) ;
			if ( AC.Query ( buf , n , i + 1 ) ) ++ res ;
		}
		printf ( "total: %d\n" , res ) ;
	}
}//Work

int main () {
	Work () ;
	return 0 ;
}//main