【HDOJ】1277 全文检索

AC自动机，静态数组，动态分配TLE。

 /* 1277 */
 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <cstdlib>
 #include <queue>
 using namespace std;

 #define MAXL 60005
 #define TRIEN 10

 typedef struct Trie {
     int n;
     Trie *fail;
     Trie *next[TRIEN];
 } Trie;

 Trie tries[];
 int nTrie;
 char s[MAXL];
 char str[];
 int ans[], n;
 bool flag;
 Trie *root;

 Trie *newNode() {
     memset(tries[nTrie].next, , sizeof(tries[nTrie].next));
     tries[nTrie].n = ;
     tries[nTrie].fail = NULL;
     return &tries[nTrie++];
 }

 void create(char str[], int v) {
     int i = , id;
     Trie *p = root, *q;

     while (str[i]) {
         id = str[i] - '';
         ++i;
         if (p->next[id] == NULL) {
             q = newNode();
             p->next[id] = q;
         }
         p = p->next[id];
     }
     p->n = v;
 }

 void build_fail() {
     int i;
     Trie *p, *q;
     queue<Trie *> Q;

     for (i=; i<TRIEN; ++i) {
         if (root->next[i]) {
             root->next[i]->fail = root;
             Q.push(root->next[i]);
         }
     }

     while (!Q.empty()) {
         p = Q.front();
         Q.pop();
         for (i=; i<TRIEN; ++i) {
             if (p->next[i]) {
                 q = p->fail;
                 while (q) {
                     if (q->next[i]) {
                         p->next[i]->fail = q->next[i];
                         break;
                     }
                     q = q->fail;
                 }
                 if (q == NULL)
                     p->next[i]->fail = root;
                 Q.push(p->next[i]);
             }
         }
     }
 }

 void search(char s[]) {
     int i = , id;
     Trie *p = root, *q;

     while (s[i]) {
         id = s[i] - '';
         ++i;
         while (p->next[id]==NULL && p!=root)
             p = p->fail;
         p = p->next[id];
         if (p == NULL)
             p = root;
         q = p;
         while (q != root) {
             if (q->n) {
                 flag = true;
                 ans[n++] = q->n;
                 q->n = ;
             }
             q = q->fail;
         }
     }
 }

 void del(Trie *t) {
     if (t == NULL)
         return ;
     for (int i=; i<TRIEN; ++i)
         del(t->next[i]);
     free(t);
 }

 void init() {
     n = ;
     flag = false;
     nTrie = ;
     root = newNode();
 }

 int main() {
     int t, m;
     int i, j, k;

     #ifndef ONLINE_JUDGE
         freopen("data.in", "r", stdin);
         //freopen("data.out", "w", stdout);
     #endif

     while (scanf("%d %d", &t, &m) != EOF) {
         for (i=; i<t; ++i) {
             scanf("%s%*c", str);
             strcat(s, str);
         }
         getchar();
         init();
         for (i=; i<=m; ++i) {
             scanf("%*s %*s %*s %s", str);
             create(str, i);
         }
         build_fail();
         search(s);
         if (flag) {
             printf("Found key:");
             for (i=; i<n; ++i)
                 printf(" [Key No. %d]", ans[i]);
             printf("\n");
         } else {
             printf("No key can be found !\n");
         }
     }

     return ;
 }