HDU 4416 Good Article Good sentence

Good Article Good sentence

Time Limit: 3000ms

Memory Limit: 32768KB

This problem will be judged on HDU. Original ID: 4416
64-bit integer IO format: %I64d      Java class name: Main

 

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

 

题意：给一个字符串S和一系列字符串T1~Tn，问在S中有多少个不同子串满足它不是T1~Tn中任意一个字符串的子串

解题：后缀自动机

 

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn = 100010;
int sa[maxn<<1],c[maxn];
struct node{
    int son[26],f,len,deep;
    void init(){
        memset(son,-1,sizeof son);
        deep = len = 0;
        f = -1;
    }
};
struct SAM{
    node e[maxn<<1];
    int tot,last;
    int newnode(int len = 0){
        e[tot].init();
        e[tot].len = len;
        return tot++;
    }
    void init(){
        tot = last = 0;
        newnode();
    }
    void add(int c){
        int p = last,np = newnode(e[p].len + 1);
        while(p != -1 && e[p].son[c] == -1){
            e[p].son[c] = np;
            p = e[p].f;
        }
        if(p == -1) e[np].f = 0;
        else{
            int q = e[p].son[c];
            if(e[p].len + 1 == e[q].len) e[np].f = q;
            else{
                int nq = newnode();
                e[nq] = e[q];
                e[nq].len = e[p].len + 1;
                e[q].f = e[np].f = nq;
                while(p != -1 && e[p].son[c] == q){
                    e[p].son[c] = nq;
                    p = e[p].f;
                }
            }
        }
        last = np;
    }
    void update(char *str){
        int ln = 0,p = 0;
        for(int i = 0; str[i]; ++i){
            int c = str[i] - 'a';
            if(e[p].son[c] != -1){
                p = e[p].son[c];
                e[p].deep = max(e[p].deep,++ln);
            }else{
                while(p != -1 && e[p].son[c] == -1) p = e[p].f;
                if(p == -1) p = ln = 0;
                else{
                    ln = e[p].len + 1;
                    p = e[p].son[c];
                    e[p].deep = max(e[p].deep,ln);
                }
            }
        }
    }
    LL count(){
        LL ret = 0;
        for(int i = tot-1; i > 0; --i){
            int v = sa[i];
            if(e[v].deep > 0){
                e[e[v].f].deep = max(e[e[v].f].deep,e[v].deep);
                if(e[v].deep < e[v].len) ret += e[v].len - e[v].deep;
            }else ret += e[v].len - e[e[v].f].len;
        }
        return ret;
    }
}sam;
char str[maxn];
int main(){
    int kase,m,cs = 1;
    scanf("%d",&kase);
    while(kase--){
        scanf("%d%s",&m,str);
        sam.init();
        for(int i = 0; str[i]; ++i) sam.add(str[i] - 'a');
        memset(c,0,sizeof c);
        for(int i = 0; i < sam.tot; ++i) c[sam.e[i].len]++;
        for(int i = 1,len = strlen(str); i <= len; ++i) c[i] += c[i-1];
        for(int i = sam.tot-1; i >= 0; --i) sa[--c[sam.e[i].len]] = i;
        while(m--){
            scanf("%s",str);
            sam.update(str);
        }
        printf("Case %d: %I64d
",cs++,sam.count());
    }
    return 0;
}