BZOJ3172 [Tjoi2013]单词

就是裸的AC自动机？、、、

于是蒟蒻顺便又复习（重新学习）了一下。。

找到了个bfs版本的AC自动机，在此Orz BLADEVIL，但是讨厌用链表的说！

/**************************************************************
    Problem: 3172
    User: rausen
    Language: C++
    Result: Accepted
    Time:308 ms
    Memory:117996 kb
****************************************************************/
 
#include <cstdio>
#include <cstring>
 
using namespace std;
const int N = 205;
const int Len = 1000005;
 
struct node {
    int cnt, f;
    int son[26];
    bool is_tail;
} t[Len];
 
int n, cnt = 1, root = 1;
int q[Len], w[N];
int head, tail;
 
#define x (int) ch - 'a'
#define is_alpha(ch) 'a' <= ch && ch <= 'z'
void build_trie() {
    int i, j, now, len;
    char ch;
    scanf("%d
", &n);
    for (i = 1; i <= n; ++i) {
        now = root;
        for (j = 1, ch = getchar(); is_alpha(ch); ++j, ch = getchar()) {
            if (!t[now].son[x])
                t[now].son[x] = ++cnt;
            ++t[now = t[now].son[x]].cnt;
        }
        w[i] = now;
    }
}
 
#define Son_p t[p].son[i]
#define Son_to t[to].son[i]
void build_AC() {
    int i, to, p;
    t[root].f = root, q[1] = root;
    for (head = 0, tail = 1; head < tail; ) {
        to = t[p = q[++head]].f;
        for (i = 0; i < 26; ++i) if (Son_p) {
            q[++tail] = Son_p;
            t[Son_p].f = Son_to && Son_to != Son_p ? Son_to : root;
        } else Son_p = t[t[p].f].son[i];
    }
}
 
void work() {
    int i;
    for (i = tail; i; --i)
        t[t[q[i]].f].cnt += t[q[i]].cnt;
    for (i = 1; i <= n; ++i)
        printf("%d
", t[w[i]].cnt);
}
 
int main() {
    build_trie();
    build_AC();
    work();
    return 0;
}