Keywords Search HDU - 2222

//AC自动机模板 

这道题直接用字符的ASCLL码表示会TLE。。。。所以用0-26表示

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;

const int N = 10000*50+5;

struct Trie {
	int next[N][26],fail[N],end[N];
	int root,L;
	int newnode() {
		for(int i = 0; i < 26; i++)
			next[L][i] = -1;
		end[L++] = 0;
		return L-1;
	}
	void init() {
		L = 0;
		root = newnode();
	}
	void insert(char s[],int id) {
		int len = strlen(s);
		int now = root;
		for(int i = 0; i < len; i++) {
			if(next[now][s[i]-'a'] == -1)
				next[now][s[i]-'a'] = newnode();
			now=next[now][s[i]-'a'];
		}
		end[now]++;
	}
	void build() {
		queue<int>Q;
		fail[root] = root;
		for(int i = 0; i < 26; i++)
			if(next[root][i] == -1)
				next[root][i] = root;
			else {
				fail[next[root][i]] = root;
				Q.push(next[root][i]);
			}
		while(!Q.empty()) {
			int now = Q.front();
			Q.pop();
			for(int i = 0; i < 26; i++)
				if(next[now][i] == -1)
					next[now][i] = next[fail[now]][i];
				else {
					fail[next[now][i]] = next[fail[now]][i];
					Q.push(next[now][i]);
				}
		}
	}
	void query(char buf[],int n) {
		int len = strlen(buf);
		int now = root;
		int res = 0;
		bool flag = false;
		for(int i = 0; i < len; i++) {
			now = next[now][buf[i]-'a'];
			int temp = now;
			while(temp != root) {
				res += end[temp];
				end[temp] = 0;
				temp = fail[temp];
			}
		}
		cout << res << endl;
	}
};
char buf[1000000+5];
Trie ac;
int main() {
	int n,m;
	int T;

	scanf("%d", &T);
	while(T--) {
		scanf("%d", &n);
		ac.init();
		for(int i = 1; i <= n; i++) {
			scanf("%s",buf);
			ac.insert(buf,i);
		}
		ac.build();

		scanf("%s",buf);
		ac.query(buf,n);
	}
	return 0;
}