HDU 2222 Keywords Search（AC自动机）

裸的AC自动机，

这倒题不能使用静态数组模拟建树的过程，10000*50*26这样会爆内存，所以使用指针，使用结构体动态分配new

这个可以用来做模板了

//#pragma comment(linker, "/STACK:1677721600")
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <ctime>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
#define INF 0x3f3f3f3f
#define inf (-((LL)1<<40))
#define lson k<<1, L, (L + R)>>1
#define rson k<<1|1,  ((L + R)>>1) + 1, R
#define mem0(a) memset(a,0,sizeof(a))
#define mem1(a) memset(a,-1,sizeof(a))
#define mem(a, b) memset(a, b, sizeof(a))
#define FIN freopen("in.txt", "r", stdin)
#define FOUT freopen("out.txt", "w", stdout)
#define rep(i, a, b) for(int i = a; i <= b; i ++)
#define dec(i, a, b) for(int i = a; i >= b; i --)

template<class T> T MAX(T a, T b) { return a > b ? a : b; }
template<class T> T MIN(T a, T b) { return a < b ? a : b; }
template<class T> T GCD(T a, T b) { return b ? GCD(b, a%b) : a; }
template<class T> T LCM(T a, T b) { return a / GCD(a,b) * b;    }

//typedef __int64 LL;
typedef long long LL;
const int MAXN = 10000 + 100;
const int MAXM = 1000010;
const double eps = 1e-8;
LL MOD = 1000000007;

const int SIGMA_SIZE = 26;
const int MAX_LEN = 52;

struct Node {
    int val;
    Node *ch[SIGMA_SIZE];
    Node *f, *last;
    Node() {
        rep (i, 0, SIGMA_SIZE - 1) {
            ch[i] = NULL;
        }
        f = last = NULL;
        val = 0;//非结点
    }
};

struct ACMachine {
    int node_cnt;
    Node *head;
    queue<Node*>q;

    void init() {
        node_cnt = 0;
        head = new Node();
    }
    int get_idx(char ch) {
        return ch - 'a';
    }
    void insert_to_tree(char *str) {
        Node *u = head;
        for(int i = 0; str[i]; i ++) {
            int c = get_idx(str[i]);
            if(!u->ch[c]) {
                u->ch[c] = new Node();
            }
            u = u->ch[c];
        }
        u->val ++;
    }
    void getFail() {
        q.push(head);
        while(!q.empty()) {
            Node *r = q.front(); q.pop();
            rep (c, 0, SIGMA_SIZE - 1) {
                Node *u = r->ch[c];
                if(u == NULL) {
                    if(r != head) r->ch[c] = r->f->ch[c];
                    continue;
                }
                q.push(u);
                if(r == head) { u->f = head; continue; }
                Node *v = r->f;
                while(v && v->ch[c] == NULL) v = v->f;
                u->f = v == NULL ? head : v->ch[c];
                u->last = u->f->val ? u->f : u->f->last;
            }
        }
    }
    int findAns(char *T) {
        int n = strlen(T), ans = 0;
        Node *u = head;
        rep (i, 0, n - 1) {
            int c = get_idx(T[i]);
            u = u->ch[c];
            if(!u) u = head;
            Node *v = u;
            while(v != NULL) {
                if(v->val >= 0) {
                    ans += v->val;
                    v->val = -1;
                }
                else break;
                v = v->last;
            }
        }
        return ans;
    }
}acm;

int t, n;
char str[MAXM];

int main()
{
//    FIN;
    cin >> t;
    while(t--) {
        acm.init();
        scanf("%d%*c", &n);
        rep (i, 1, n) {
            scanf("%s", str);
            acm.insert_to_tree(str);
        }
        scanf("%s", str);
        acm.getFail();
        cout << acm.findAns(str) << endl;
    }
    return 0;
}