hdu 1277 AC自动机

全文检索

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1134 Accepted Submission(s): 357

Problem Description

我们大家经常用google检索信息，但是检索信息的程序是很困难编写的；现在请你编写一个简单的全文检索程序。
问题的描述是这样的：给定一个信息流文件，信息完全有数字组成，数字个数不超过60000个，但也不少于60个；再给定一个关键字集合，其中关键字个数不超过10000个，每个关键字的信息数字不超过60个，但也不少于5个；两个不同的关键字的前4个数字是不相同的；由于流文件太长，已经把它分成多行；请你编写一个程序检索出有那些关键字在文件中出现过。

Input

第一行是两个整数M，N；M表示数字信息的行数，N表示关键字的个数；接着是M行信息数字，然后是一个空行；再接着是N行关键字；每个关键字的形式是：[Key No. 1] 84336606737854833158。

Output

输出只有一行，如果检索到有关键字出现，则依次输出，但不能重复，中间有空格，形式如：Found key: [Key No. 9] [Key No. 5]；如果没找到，则输出形如：No key can be found !。

Sample Input

20 10 646371829920732613433350295911348731863560763634906583816269 637943246892596447991938395877747771811648872332524287543417 420073458038799863383943942530626367011418831418830378814827 679789991249141417051280978492595526784382732523080941390128 848936060512743730770176538411912533308591624872304820548423 057714962038959390276719431970894771269272915078424294911604 285668850536322870175463184619212279227080486085232196545993 274120348544992476883699966392847818898765000210113407285843 826588950728649155284642040381621412034311030525211673826615 398392584951483398200573382259746978916038978673319211750951 759887080899375947416778162964542298155439321112519055818097 642777682095251801728347934613082147096788006630252328830397 651057159088107635467760822355648170303701893489665828841446 069075452303785944262412169703756833446978261465128188378490 310770144518810438159567647733036073099159346768788307780542 503526691711872185060586699672220882332373316019934540754940 773329948050821544112511169610221737386427076709247489217919 035158663949436676762790541915664544880091332011868983231199 331629190771638894322709719381139120258155869538381417179544 000361739177065479939154438487026200359760114591903421347697

[Key No. 1] 934134543994403697353070375063

[Key No. 2] 261985859328131064098820791211

[Key No. 3] 306654944587896551585198958148

[Key No. 4] 338705582224622197932744664740

[Key No. 5] 619212279227080486085232196545

[Key No. 6] 333721611669515948347341113196

[Key No. 7] 558413268297940936497001402385

[Key No. 8] 212078302886403292548019629313

[Key No. 9] 877747771811648872332524287543

[Key No. 10] 488616113330539801137218227609

Sample Output

Found key: [Key No. 9] [Key No. 5]

  1 #include <iostream>
  2 #include <cstdio>
  3 #include <cstring>
  4 #include <queue>
  5 #include <algorithm>
  6 using namespace std;
  7 
  8 typedef struct node
  9 {
 10     int id;
 11     node *fail;
 12     node *next[10];
 13     node()
 14     {
 15         id = 0;
 16         fail = NULL;
 17         memset(next,NULL, sizeof(next));
 18     }
 19 }TreeNode;
 20 
 21 int res[10005];
 22 int nCount = 0;
 23 
 24 void Insert(TreeNode *pRoot, char Substr[], int id)
 25 {
 26     int nLen = strlen(Substr);
 27     TreeNode *p = pRoot;
 28     for (int i = 0; i < nLen; i++)
 29     {
 30         int index = Substr[i] - '0';
 31         if (p->next[index] == NULL)
 32         {
 33             p->next[index] = new TreeNode;
 34         }
 35         p = p->next[index];
 36     }
 37     p->id = id;
 38 }
 39 
 40 void getFail(TreeNode *pRoot)
 41 {
 42     queue<TreeNode*> Queue;
 43     Queue.push(pRoot);
 44     while(!Queue.empty())
 45     {
 46         TreeNode *p = Queue.front();
 47         Queue.pop();
 48         for (int i = 0; i < 10; i++)
 49         {
 50             if (p->next[i] != NULL)
 51             {
 52                 if (p == pRoot)
 53                 {
 54                     p->next[i]->fail = pRoot;
 55                 }
 56                 else
 57                 {
 58                     TreeNode *temp = p->fail;
 59                     while(temp != NULL)
 60                     {
 61                         if (temp->next[i] != NULL)
 62                         {
 63                             p->next[i]->fail = temp->next[i];
 64                             break;
 65                         }
 66                         temp = temp->fail;
 67                     }
 68                     if (temp == NULL)
 69                     {
 70                         p->next[i]->fail = pRoot;
 71                     }
 72                 }
 73                 Queue.push(p->next[i]);
 74             }
 75         }
 76     }
 77 }
 78 
 79 void find(TreeNode *pRoot, char str[])
 80 {
 81     TreeNode *p = pRoot;
 82     int nLen = strlen(str);
 83     for (int i = 0; i < nLen; i++)
 84     {
 85         int index = str[i] - '0';
 86         while(p != pRoot && p->next[index] == NULL)
 87         {
 88             p = p->fail;
 89         }
 90         p = p->next[index];
 91         if (p == NULL)
 92         {
 93             p = pRoot;
 94         }
 95         TreeNode *temp = p;
 96         while(temp != pRoot)
 97         {
 98             if (temp->id > 0)
 99             {
100                 res[nCount++] = temp->id;
101                 temp->id = 0;//同一个关键字只用一次
102             }
103             temp = temp->fail;
104         }
105     }
106 }
107 
108 void DeleteNode(TreeNode *pRoot)
109 {
110     for (int i = 0; i < 10; i++)
111     {
112         if (pRoot != NULL)
113         {
114             DeleteNode(pRoot->next[i]);
115         }
116     }
117     delete pRoot;
118 }
119 
120 int main()
121 {
122     int i,m, n,c;
123     char temp[105];
124     char str[60001];
125     while(~scanf("%d%d", &m, &n))
126     {
127         strcpy(str,"");
128         TreeNode *pRoot = new TreeNode;
129         for (i = 0; i < m; i++)
130         {
131             scanf("%s", temp);
132             strcat(str, temp);
133         }
134         getchar();
135         for (i = 0; i < n; i++)
136         {
137             getchar();
138             scanf("[Key No. %d] %s",&c,temp);
139             Insert(pRoot, temp, i + 1);
140         }
141         getFail(pRoot);
142         find(pRoot, str);
143         if (nCount)
144         {
145             printf("Found key:");
146             for (i = 0; i < nCount; i++)
147             {
148                 printf(" [Key No. %d]", res[i]);
149             }
150             printf("
");
151         }
152         else
153         {
154             printf( "No key can be found !
" );     
155         }
156     //    DeleteNode(pRoot);
157     }
158     return 0;
159 }