AC自动机模板

#include<bits/stdc++.h>
using namespace std;
#define M(a, b) memset(a, b, sizeof(a));
const int maxn = 1000 + 10;

struct AhoCorasickAutomata {
    int ch[maxn][26], val[maxn], last[maxn], f[maxn], sz;

    int idx(char s) { return s - 'a'; }

    void init() {
        sz = 0;
        M(ch, 0); M(val, 0); M(last, 0);
    } 

    void insert(char* s, int v) {
        int u = 0, len = strlen(s);
        for (int i = 0; i < len; ++i) {
            int c = idx(s[i]);
            if (!ch[u][c]) {
                ch[u][c] = ++sz;
                val[sz] = 0;
                M(ch[sz], 0);
            }
            u = ch[u][c];
        }
        val[u] = v;
    }

    void getFail() {
        queue<int> q;
        f[0] = 0;
        for (int c = 0; c < 26; ++c) {
            int u = ch[0][c];
            if (u) { f[u] = 0; q.push(u); last[u] = 0; }
        }
        while(!q.empty()) {
            int r = q.front(); q.pop();
            for (int c = 0; c < 26; ++c) {
                int u = ch[r][c];
                if (!u) { ch[r][c] = ch[f[r]][c]; continue; }
                q.push(u);
                int v = f[r];
                while(v && !ch[v][c]) v = f[v]; //找到失配的第一个结点
                f[u] = ch[v][c];
                last[u] = val[f[u]] ? f[u] : last[f[u]];
            }
        }
    }

    void print(int j) {
        if (j) {
            printf("%d: %d
", j, val[j]);
            print(last[j]);
        }
    }

    void find(char* T) {
        int len = strlen(T);
        int j = 0;
        for (int i = 0; i < len; ++i) {
            int c = idx(T[i]);
            j = ch[j][c];
            if (val[j]) print(j);
            else if (last[j]) print(last[j]);
        }
    }

};

AhoCorasickAutomata ac;

int main() {
    int n, m, v;
    char s[maxn];
    while(~scanf("%d%d", &n, &m)) {
        ac.init();
        while(n--) {
            scanf("%s %d", s, &v);
            ac.insert(s, v);
        }
        ac.getFail();
        while(m--) {
            scanf("%s", s);
            ac.find(s);
        }
    }

    return 0;
}