POJ 4052 Hrinity [AC自动机]

　　跟2010福州的现场赛那题基本一样的，只是多了个去重。。上半年在金华邀请赛的时候还不会AC自动机，今天突然想起来就找出来写了一下。。数据给的很大，不过空间给的也是巨大=。=

　　解码后就是裸的自动机，把包含的串标记一下，再用自动机找这些串的子串去重即可。

#include <string.h>
#include <stdio.h>
#define MAXN 3000000
int cas, n;
int pos, next[MAXN][26], fail[MAXN], id[MAXN], flag[MAXN];
char s[MAXN*2], ss[MAXN*2], sss[2600][1200];
char *trans(char *ss, char *s){
    int len = 0, pp = 0;
    for (int i = 0; s[i]; i++) {
        if(s[i] == '[' || s[i] == ']')pp = 0;
        else if(s[i] >= '0' && s[i] <= '9')pp = pp*10+s[i]-'0';
        else if(s[i] >= 'A' && s[i] <= 'Z'){
            if (pp == 0) ss[len++] = s[i];
            else while (pp--) ss[len++] = s[i];
        }
    }
    ss[len] = '\0';
    return ss;
}
int newnode(){
    memset(next[pos], 0, sizeof next[pos]);
    id[pos] = -1, fail[pos] = flag[pos] = 0;
    return pos++;
}
void insert(char *s, int ids){
    int p = 0;
    for (int i = 0; s[i]; i++) {
        int &x = next[p][s[i] - 'A'];
        p = x ? x : x = newnode();
    }
    id[p] = ids;
}
int q[MAXN], front, rear;
void makefail(){
    q[front = rear = 0] = 0,rear++;
    while (front < rear) {
        int u = q[front++];
        for (int i = 0; i < 26; i++) {
            int v = next[u][i];
            if (v) q[rear++] = v;
            else next[u][i] = next[fail[u]][i];
            if (v&&u) fail[v] = next[fail[u]][i];
        }
    }
}
int vis[3000];
void removestr(int ids, char *s){
    for (int i = 0, p = 0; s[i]; i++){
        p = next[p][s[i]-'A'];
        for (int j = p; j; j = fail[j]){
            if (id[j] >= 0 && ids != id[j]) vis[id[j]] = 0;
        }
    }
}
int makeans(char *s){
    memset(vis, 0, sizeof vis);
    for (int i = 0, p = 0; s[i]; i++){
        p = next[p][s[i]-'A'];
        for (int j = p; j && flag[j] != -1; j = fail[j]){
            if (id[j] >= 0) vis[id[j]] = 1;
            flag[j] = -1;
        }
    }
    for (int i = 0; i < n; i++) if(vis[i] == 1) removestr(i, sss[i]);
    int ans = 0;
    for (int i = 0; i < n; i++) if(vis[i] == 1) ans ++;
    return ans;
}
int main(){
    //freopen("test.in", "r", stdin);
    scanf("%d", &cas);
    while (cas--) {
        scanf("%d", &n);
        pos = 0; newnode();
        for (int i = 0; i < n; i++) {
            scanf("%s", s);
            trans(sss[i], s);
            insert(sss[i], i);
        }
        makefail();
        scanf("%s", s);
        trans(ss, s);
        printf("%d\n", makeans(ss));
    }
    return 0;
}