Keywords Search
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 61000 Accepted Submission(s): 20114
Problem Description
In the modern time, Search engine came into the life of everybody like Google, Baidu, etc.
Wiskey also wants to bring this feature to his image retrieval system.
Every image have a long description, when users type some keywords to find the image, the system will match the keywords with description of image and show the image which the most keywords be matched.
To simplify the problem, giving you a description of image, and some keywords, you should tell me how many keywords will be match.
Input
First line will contain one integer means how many cases will follow by.
Each case will contain two integers N means the number of keywords and N keywords follow. (N <= 10000)
Each keyword will only contains characters ‘a’-‘z’, and the length will be not longer than 50.
The last line is the description, and the length will be not longer than 1000000.
Output
Print how many keywords are contained in the description.
Sample Input
1
5
she
he
say
shr
her
yasherhs
Sample Output
3
//要倒背如流
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
using namespace std;
#define N 500010
char str[1000010], keyword[51];
int head, tail;
struct node{
node *next[26];
node *fail;
int count;
node() {
for( int i = 0; i < 26; i++ )
next[i] = NULL;
fail = NULL;
count = 0;
}
}*q[N];
node *root;
void insert( char *str ) {//插入
int temp,len;
len = strlen(str);
node *p = root;
for( int i = 0; i < len; i++ ) {
temp = str[i] - 'a';
if( p->next[temp] == NULL )
p->next[temp] = new node();
p = p->next[temp];
}
p->count++;
}
void build() {//主要建fail指针
q[tail++] = root;
while( head != tail ){
node *p = q[head++];
node *temp = NULL;
for( int i = 0; i < 26; i++ ) {
if( p->next[i] != NULL ) {
if( p == root )
p->next[i]->fail = root;//根节点指向根节点
else{
temp = p->fail;
while( temp != NULL ) {//找到匹配or not
if( temp->next[i] != NULL ) {
p->next[i]->fail = temp->next[i];
break;
}
temp = temp->fail;//前边的肯定已经找到fail
}
if( temp == NULL )
p->next[i]->fail = root;
}
q[tail++] = p->next[i];
}
}
}
}
int query() {
int index, result, len;
node *p = root;
result = 0;
len = strlen(str);
for( int i = 0; i < len; i++ ) {
index = str[i] - 'a';
while( p->next[index] == NULL && p != root )
p = p->fail;
p = p->next[index];
if( p == NULL ) p = root;
node *temp = p;
while( temp != root && temp->count != -1 ) {
result += temp->count;
temp->count = -1;//已经查到,下次出现不算了
temp = temp->fail;
}
}
return result;
}
int main() {
int T, num;
scanf("%d", &T);
while( T-- ) {
head = tail = 0;
root = new node();
scanf("%d", &num);
getchar();
for( int i = 0; i < num; i++ ) {
gets(keyword);
insert(keyword);
}
build();
scanf("%s", str);
printf("%d\n", query());
}
return 0;
}