【AC自动机】 HDU 3065 病毒侵袭持续中

点击打开链接

遇到非大写字母要初始化。

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <string>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cmath>
using namespace std;
#include <queue>
#include <stack>
#include <vector>
#include <deque>
#include <set>
#include <map>
#define cler(arr, val) memset(arr, val, sizeof(arr))
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define IN freopen ("in.txt" , "r" , stdin);
#define OUT freopen ("out.txt" , "w" , stdout);
typedef long long LL;
const int MAXN = 510011;
const int MAXM = 6000010;
const int INF = 0x3f3f3f3f;
const LL mod = 2147483647;
const double eps= 1e-8;
const double pi=acos(-1.0);
#define lson l,m, rt<<1
#define rson m+1,r,rt<<1|1
#define maxnode 70101
#define sigma_size 26
int n;
int num[1122];
struct trie
{
int ch[maxnode][sigma_size];
int val[maxnode];
int fail[maxnode];
int last[maxnode];
int sz;
void init()
{
cler(ch[0],0);
cler(last,0);
cler(fail,0);
sz=1;
}
int newnode()
{
cler(ch[sz],0);
val[sz]=0;
return sz++;
}
int idx(char s)
{
if('A'<=s&&s<='Z')
return s-'A'+1;
else return 0;
}
void insert(char *s,int num)
{
int u=0,len=strlen(s);
for(int i=0;i<len;i++)
{
int c=idx(s[i]);
if(!ch[u][c])
ch[u][c]=newnode();
u=ch[u][c];
}
val[u]=num;
}
void getfail()
{
queue<int>q;
fail[0]=0;
for(int i=0;i<sigma_size;i++)
{
int u=ch[0][i];
if(u) {fail[u]=0;q.push(u);last[u]=0;}
}
while(!q.empty())
{
int r=q.front();q.pop();
for(int c=0;c<sigma_size;c++)
{
int u=ch[r][c];
if(!u) continue;
q.push(u);
int v=fail[r];
while(v&&!ch[v][c])
v=fail[v];
fail[u]=ch[v][c];
last[u]=val[fail[u]]?fail[u]:last[fail[u]];
}
}
}
int find(char *s)
{
int u=0,len=strlen(s),ans=0;
for(int i=0;i<len;i++)
{
int c=idx(s[i]);
while(u&&!ch[u][c]) u=fail[u];
u=ch[u][c];
int temp=u;
while(val[temp]&&temp)
{
num[val[temp]]++;
temp=fail[temp];
}
}
return 0;
}
}ac;
char s[1122][51],c[2000010];
int main()
{
int m;
while(cin>>n)
{
cler(num,0);
ac.init();
for(int i=0;i<n;i++)
{
scanf("%s",s[i]);
ac.insert(s[i],i+1);
}
ac.getfail();
scanf("%s",c);
ac.find(c);
for(int i=0;i<n;i++)
if(num[i+1])
printf("%s: %d\n",s[i],num[i+1]);
}
return 0;
}