#include <stdio.h>
#include <string.h>
#include <queue>
using namespace std;
#define M 1000*55
typedef struct name{
char v[55];
int num;
}name;
name virus[1100];
char buf[2000010];
struct trie
{
int next[M][26], fail[M], end[M], l, root;
int newnode()
{
for(int i=0; i<26; i++)
next[l][i] = -1;
end[l++] = -1;
return l-1;
}
void init()
{
l = 0;
root = newnode();
}
void insert(char ch[], int id)
{
int len = strlen(ch);
int now = root;
for(int i=0; i<len; i++){
if(next[now][ ch[i]-'A' ] == -1)
next[now][ ch[i]-'A' ] = newnode();
now = next[now][ ch[i]-'A' ];
}
end[now] = id;
}
void build()
{
queue<int> Q;
fail[root] = root;
for(int i=0; i<26; i++){
if( next[root][i] == -1 )
next[root][i] = root;
else{
fail[ next[root][i] ] = root;
Q.push( next[root][i] );
}
}
while( !Q.empty() ){
int now = Q.front(); Q.pop();
for(int i=0; i<26; i++){
if( next[now][i] == -1 )
next[now][i] = next[ fail[now] ][i];
else{
fail[ next[now][i] ] = next[ fail[now] ][i];
Q.push( next[now][i] );
}
}
}
}
void query(char ch[], int n)
{
int len = strlen(ch);
int now = root;
for(int i=0; i<len; i++){
if(ch[i]>='A' && ch[i]<='Z'){
now = next[now][ch[i]-'A'];
int temp = now;
while(temp != root){
if( end[temp]!=-1 )
virus[end[temp]].num++;
temp = fail[ temp ];
}
}
else
now = root;
}
// bool flag = false;
for(int i=0; i<n; i++){
if(virus[i].num != 0){
printf("%s: %d\n", virus[i].v, virus[i].num);
}
}
}
};
trie ac;
int main()
{
int n, i;
while( scanf("%d", &n)!=-1 ){
ac.init();
for( i=0; i<n; i++){
scanf("%s", virus[i].v);
virus[i].num = 0;
ac.insert(virus[i].v, i);
}
ac.build();
// int j = 0;
i = 0;
getchar();
gets(buf);
/*while(buf[i]){
if(buf[i]>='A' && buf[i]<='Z')
buf[j++] = buf[i];
i++;
}
buf[j] = 0;*/
ac.query(buf, n);
}
return 0;
}
病毒侵袭持续中
最新推荐文章于 2020-03-25 20:47:10 发布