HDU 6208 The Dominator of Strings 后缀自动机

The Dominator of Strings

Time Limit: 3000/3000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)

Problem Description

Here you have a set of strings. A dominator is a string of the set dominating all strings else. The string S is dominated by T if S is a substring of T.

 

Input

The input contains several test cases and the first line provides the total number of cases.
For each test case, the first line contains an integer N indicating the size of the set.
Each of the following N lines describes a string of the set in lowercase.
The total length of strings in each case has the limit of 100000.
The limit is 30MB for the input file.

 

Output

For each test case, output a dominator if exist, or No if not.

 

Sample Input

3
10
you
better
worse
richer
poorer
sickness
health
death
faithfulness
youbemyweddedwifebetterworsericherpoorersicknesshealthtilldeathdouspartandpledgeyoumyfaithfulness
5
abc
cde
abcde
abcde
bcde
3
aaaaa
aaaab
aaaac

 

Sample Output

youbemyweddedwifebetterworsericherpoorersicknesshealthtilldeathdouspartandpledgeyoumyfaithfulness
abcde
No

 

 

题意：

　　给你n个串，问你是否村你在一个串，包含了其他所有串

题解：

　　必然是最长串，

　　将 其建立后缀自动机， 并将剩余的串与其匹配，也就是最长公共字串 长度　　

　　ios::sync_with_stdio(false); cin.tie(0); 这句话 可以加快C++输入输出，不加就TLE

#include <bits/stdc++.h>
inline long long read(){long long x=,f=;char ch=getchar();while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}return x*f;}
using namespace std;

const int N = 2e5+;
const long long mod = ;

int isPlus[N * ],endpos[N * ];int d[N * ];
int tot,slink[*N],trans[*N][],minlen[*N],maxlen[*N],pre;
int newstate(int _maxlen,int _minlen,int* _trans,int _slink){
    maxlen[++tot]=_maxlen;minlen[tot]=_minlen;
    slink[tot]=_slink;
    if(_trans)for(int i=;i<;i++)trans[tot][i]=_trans[i];
    return tot;
}
int add_char(char ch,int u){
    int c=ch-'a',v=u;
    int z=newstate(maxlen[u]+,-,NULL,);
    isPlus[z] = ;
    while(v&&!trans[v][c]){trans[v][c]=z;d[z]+=;v=slink[v];}
    if(!v){ minlen[z]=;slink[z]=;return z;}
    int x=trans[v][c];
    if(maxlen[v]+==maxlen[x]){slink[z]=x;minlen[z]=maxlen[x]+;return z;}
    int y=newstate(maxlen[v]+,-,trans[x],slink[x]);
    slink[z]=slink[x]=y;minlen[x]=minlen[z]=maxlen[y]+;
    while(v&&trans[v][c]==x){trans[v][c]=y;d[x]--,d[y]++;v=slink[v];}
    minlen[y]=maxlen[slink[y]]+;
    return z;
}
void init_sam() {
    for(int i = ; i <= tot; ++i)
        for(int j = ; j < ; ++j) trans[i][j] = ;
    pre = tot = ;
}
int T,n;
string a[N];
int main() {
    ios::sync_with_stdio(false); cin.tie();
    cin>>T;
    while(T--) {
        cin>>n;
        int mx = ,flag = ;int ok = ;
        for(int i = ; i <= n; ++i) {
            cin >> a[i];
            if(a[i].length() > mx) {
                mx = a[i].length();
                flag = i;
            }
        }
        init_sam();
        for(int i = ; i < mx; ++i)
            pre = add_char(a[flag][i],pre);
        for(int i = ; i <= n; ++i) {
            if(i == flag) continue;
            int now = ;
            int p = ;
            int ans = ;
            for(int j = ; j < a[i].length(); ++j) {
                if(trans[p][a[i][j]-'a']) {
                    now += ;
                    p = trans[p][a[i][j]-'a'];
                }else {
                    while(p) {
                        p = slink[p];
                        if(trans[p][a[i][j]-'a']) break;
                    }
                    if(!p) p = ,now = ;
                    else {
                        now = maxlen[p] + ;
                        p = trans[p][a[i][j]-'a'];
                    }
                }
                ans = max(ans,now);
            }
            if(ans != a[i].length()) {
                cout<<"No"<<endl;
                ok = ;
                break;
            }
        }
        if(!ok) cout<<a[flag]<<endl;
    }
    return ;
}