Hdu 4416 Good Article Good sentence 后缀自动机

Good Article Good sentence

Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3964    Accepted Submission(s): 1162

Problem Description

In middle school, teachers used to encourage us to pick up pretty sentences so that we could apply those sentences in our own articles. One of my classmates ZengXiao Xian, wanted to get sentences which are different from that of others, because he thought the distinct pretty sentences might benefit him a lot to get a high score in his article.
Assume that all of the sentences came from some articles. ZengXiao Xian intended to pick from Article A. The number of his classmates is n. The i-th classmate picked from Article Bi. Now ZengXiao Xian wants to know how many different sentences she could pick from Article A which don't belong to either of her classmates?Article. To simplify the problem, ZengXiao Xian wants to know how many different strings, which is the substring of string A, but is not substring of either of string Bi. Of course, you will help him, won't you?

 

Input

The first line contains an integer T, the number of test data. 
For each test data
The first line contains an integer meaning the number of classmates.
The second line is the string A;The next n lines,the ith line input string Bi.
The length of the string A does not exceed 100,000 characters , The sum of total length of all strings Bi does not exceed 100,000, and assume all string consist only lowercase characters 'a' to 'z'.

 

Output

For each case, print the case number and the number of substrings that ZengXiao Xian can find.

 

Sample Input

  
  

   
   3
2
abab
ab
ba
1
aaa
bbb
2
aaaa
aa
aaa
  
  

 

Sample Output

  
  

   
   Case 1: 3
Case 2: 3
Case 3: 1
  
  

 

Source

2012 ACM/ICPC Asia Regional Hangzhou Online

求是字符串A的子串，且不是一组字符串Bi当中任意一个的子串的串的个数。

对字符串A建立后缀自动机，把B中所有字符串在自动机上匹配，记录自动机每个状态能匹配到的最大长度，并且把这个最大长度向父亲转移。每个状态q原先贡献的子串个数是q.len-father(q).len,现在为min(q.len-father(q).len,q.len-q.maxlen(匹配到的最大长度)  )。

#include <cstdio>
#include <iostream>
#include <string.h>
#include <string> 
#include <map>
#include <queue>
#include <deque>
#include <vector>
#include <set>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <stack>
#include <iomanip>
#define mem0(a) memset(a,0,sizeof(a))
#define meminf(a) memset(a,0x3f,sizeof(a))
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
const int maxn=100005,maxk=26,inf=0x3f3f3f3f;  
const ll llinf=0x3f3f3f3f3f3f3f3f;   
const ld pi=acos(-1.0L);
char s[maxn],t[maxn]; 

struct SAM {  
	int num,last;  
    struct node{  
        int len,fa,maxlen;  
        int son[maxk];  
    } a[maxn*2];  
    void init() {  
        num=last=0;  
        a[0].len=0;a[0].fa=-1;  
        for (int i=0;i<maxk;i++) a[0].son[i]=-1;  
    }  
    void update (int c) {  
        int now=++num,p;  
        a[now].len=a[last].len+1;
        a[now].maxlen=0;
        memset(a[now].son,-1,sizeof(a[now].son));  
        for (p=last;p!=-1&&a[p].son[c]==-1;p=a[p].fa)  
            a[p].son[c]=now;  
        if (p==-1) a[now].fa=0; else {  
            int q=a[p].son[c];  
            if (a[p].len+1==a[q].len) {  
                a[now].fa=q;  
            } else {  
                int ne=++num;  
                a[ne].len=a[p].len+1;
                a[ne].maxlen=0;
                memcpy(a[ne].son,a[q].son,sizeof(a[q].son));  
                a[ne].fa=a[q].fa;  
                for (;p!=-1&&a[p].son[c]==q;p=a[p].fa)   
                    a[p].son[c]=ne;  
                a[q].fa=a[now].fa=ne;  
            }  
        }  
        last=now;  
    }  
    int getfa(int n) {
    	return a[n].fa;
    }
    int getlen(int n) {
    	return a[n].len;
    }
    int getnum() {
    	return num;
    }
    int getson(int n,int c) {
    	return a[n].son[c];
    }
};  
SAM sa;

ll dp[maxn*2];
bool visit[maxn*2];
int w[maxn*2],r[maxn*2];
ll topsort(int len) {
    int m=sa.getnum(),i,j;
    ll ans=0;
    mem0(w);
    for(i=0;i<=m;i++) w[sa.getlen(i)]++;  
    for(i=0;i<=len;i++) w[i]+=w[i-1];  
    for(i=m;i>=0;i--) r[--w[sa.getlen(i)]]=i;  
    for (i=m;i>0;i--) {
    	ans+=sa.a[r[i]].len-max(sa.getlen(sa.getfa(r[i])),sa.a[r[i]].maxlen);
    	if (sa.a[r[i]].maxlen>0)
			sa.a[sa.getfa(r[i])].maxlen=sa.a[sa.getfa(r[i])].len;
    }
    return ans;
}

int main() {
	int cas,cnt=0;
	scanf("%d",&cas);
	while (cas--) {
		cnt++;
		int n,i,j,len;
		scanf("%d",&n);
		scanf("%s",s);
		len=strlen(s);
		sa.init();
		for (i=0;i<len;i++) sa.update(s[i]-'a');
		for (i=1;i<=n;i++) {
			scanf("%s",t);
			len=strlen(t);
			int now=0,l=0;
			for (j=0;j<len;j++) {
				if (sa.getson(now,t[j]-'a')!=-1) {
					l++;
					now=sa.getson(now,t[j]-'a');
					sa.a[now].maxlen=max(sa.a[now].maxlen,l);
				} else {
					while (now!=-1&&sa.getson(now,t[j]-'a')==-1)
						now=sa.getfa(now);
					if (now==-1) {
						l=0;
						now=0;
					} else {
						l=sa.getlen(now)+1;
						now=sa.getson(now,t[j]-'a');
						sa.a[now].maxlen=max(sa.a[now].maxlen,l);
					}
				}
			}
		}
		len=strlen(s);
		mem0(dp);
		ll ans=topsort(len);
		printf("Case %d: %lld\n",cnt,ans);
	}
	return 0;
}