LightOJ 1427 Substring Frequency (II)（ac自动机水题）

题意：给出一个文本串和若干模板串，求出每个模板串在文本串中出现的次数。

思路：ac自动机。

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<ctime>
#define eps 1e-6
#define LL long long
#define pii pair<int, int>
//#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;

const int maxn = 1000100;
const int SIGMA_SIZE = 26;
const int maxnode = 500000+100;
int ch[maxnode][SIGMA_SIZE+5];  
int val[maxnode]; 
map<string, int> ms; 
int q, tot, cnt[600];
char str[maxn], query[600][600];
int Hash(string str) {
	if(ms.count(str)) return ms[str];
	return ms[str] = ++tot;
}
int idx(char c) {return c - 'a';}
struct Trie {   
    int sz;  
    Trie() { sz = 1; memset(ch[0], 0, sizeof(ch[0]));};          
    void insert(char *s, int id) {  
        int u = 0, n = strlen(s);  
        for(int i = 0; i < n; i++) {  
            int c = idx(s[i]);  
            if(!ch[u][c]) {  
                memset(ch[sz], 0, sizeof(ch[sz]));  
             	val[sz] = 0;
                ch[u][c] = sz++;  
            }    
            u = ch[u][c];  
        }  
        val[u] = id;
    }  
} ;  

int last[maxn], f[maxn];
void print(int i, int j) {
	if(j) {
		cnt[val[j]]++; //cout << i << endl;
		print(i, last[j]);
	}
} 

int getFail() {
	queue<int> q;
	f[0] = 0;
	for(int c = 0; c < SIGMA_SIZE; c++) {
		int u = ch[0][c];
		if(u) {
			f[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) {
				ch[r][c] = ch[f[r]][c];
				continue;
			}
			q.push(u);
			int v = f[r];
			while(v && !ch[v][c]) v = f[v];
			f[u] = ch[v][c];
			last[u] = val[f[u]] ? f[u] : last[f[u]];
		}
	}
}

void find_T(char* T) {
	int len = strlen(T); //cout << len << endl;
	int j = 0;
	for(int i = 0; i < len; i++) {
		int c = idx(T[i]);         
		j = ch[j][c];
		if(val[j]) print(i, j);
		else if(last[j]) print(i, last[j]);
	}
} 
int main() {
    //freopen("input.txt", "r", stdin);
	int T, kase = 0;
	cin >> T;
	while(T--) {
		ms.clear();
		Trie trie;
		tot = 0;
		memset(cnt, 0, sizeof(cnt));
		scanf("%d%s", &q, str);
		int len = strlen(str);
		printf("Case %d:\n", ++kase);
		for(int i = 1; i <= q; i++) {
			scanf("%s", query[i]);
			trie.insert(query[i], Hash(string(query[i])));
		} 
		getFail();
		find_T(str);
		for(int i = 1; i <= q; i++) printf("%d\n", cnt[Hash(string(query[i]))]);
	}
    return 0;
}