HDU 2896 病毒侵袭 （AC自动机）

#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <string.h>
#include <queue>
using namespace std;

struct Trie
{
int next[205*500][128],fail[205*500],end[205*500];
int root,L;
int newnode()  //开辟空间
{
for(int i = 0;i <128;i++)
next[L][i] = -1;
end[L++] = 0;
return L-1;
}
void init()
{
L = 0;
root = newnode();
}
void insert(char buf[],int id)  //trie树
{
int len = strlen(buf);
int now = root;
for(int i = 0;i < len;i++)
{
if(next[now][buf[i]] == -1)
next[now][buf[i]] = newnode();
now = next[now][buf[i]];
}
end[now]=id;   //记录
}
void build()             //失败指针
{
queue<int>Q;
fail[root] = root;
for(int i = 0;i < 128;i++)
if(next[root][i] == -1)
next[root][i] = root;
else
{
fail[next[root][i]] = root;  //第一层指向root
Q.push(next[root][i]);        //继续
}
while( !Q.empty() )
{
int now = Q.front();
Q.pop();
for(int i = 0;i < 128;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]);
}
}
}
bool used[550];      //标记出现过的
bool query(char buf[],int m, int id)
{
int len = strlen(buf);
int now = root;
memset(used,false,sizeof(used));
bool flag=false;
int res = 0;
for(int i = 0;i < len;i++)
{
now = next[now][buf[i]];
int temp = now;
while( temp != root )
{
if(end[temp]!=0)
{
used[end[temp]]=true;
flag=true;

}
temp = fail[temp];
}
}
if(!flag)
return false;
cout<<"web "<<id<<":";
for(int i=1;i<=m;++i)
{
if(used[i])
cout<<" "<<i;

}
puts("");
return true;
}

};

char buf[10010];
Trie ac;

int main()
{
int T;
int n,m;
while(~scanf("%d",&n))
{
ac.init();
for(int i = 1;i <=n;i++)
{
scanf("%s",buf);
ac.insert(buf,i);
}
ac.build();
cin>>m;
int ans=0;
for(int i=1;i<=m;++i)
{
scanf("%s",buf);
if(ac.query(buf,n,i))
ans++;
}
cout<<"total: "<<ans<<endl;

// printf("%d\n",ac.query(buf));

}

return 0;
}