AC自动机 模板

const int maxn = 10000 * 50 + 50,sigma_size = 26;

/** AC_AUTOMATION */
int ch[maxn][sigma_size],fail[maxn],tot;
int value[maxn];

/** 初始化 */
void Init(){
memset(ch[0],0,sizeof ch[0]);
tot = 1;
fail[0] = -1;value[0] = 0;
}

/** 插入字符串 s */
void Insert(char* s){
int idx,cur = 0;
while( *s ){
idx = *s - 'a';
if(ch[cur][idx] == 0){
memset(ch[tot],0,sizeof ch[tot]);
fail[tot] = 0;
value[tot] = 0;
ch[cur][idx] = tot++;
}
cur = ch[cur][idx];
s++;
}
value[cur]++;
}

/** GetFail */
void GetFail(){
queue<int> Q;
Q.push(0);
fail[0] = -1;
int cur,idx,f;
while(!Q.empty()){
cur = Q.front();Q.pop();
for(int i = 0;i < sigma_size;++i){
if(ch[cur][i]){
f = fail[cur];
while(f != -1 && ch[f][i] == 0) f = fail[f];
fail[ch[cur][i]] = (f == -1) ? 0 : ch[f][i];
Q.push(ch[cur][i]);
}
else{
f = fail[cur];
ch[cur][i] = (f == -1) ? 0 : ch[f][i];
}
}
}
}
/**  以上具有通用性 */
/** 匹配 */
int Search(char *s){
int cur = 0,idx,ret = 0,tmp;
while(*s){
idx = *s - 'a';
tmp = cur = ch[cur][idx];
if(value[tmp]) while(tmp){
ret += value[tmp];value[tmp] = 0;
tmp = fail[tmp];
}
s++;
}
return ret;
}