HDU 4886 TIANKENG’s restaurant(Ⅱ) ( 暴力+hash )

TIANKENG’s restaurant(Ⅱ)

Time Limit: 16000/8000 MS (Java/Others)    Memory Limit: 130107/65536 K (Java/Others)
Total Submission(s): 466    Accepted Submission(s): 153

Problem Description

After improving the marketing strategy, TIANKENG has made a fortune and he is going to step into the status of TuHao. Nevertheless, TIANKENG wants his restaurant to go international, so he decides to name his restaurant in English. For the lack of English skills, TIANKENG turns to CC, an English expert, to help him think of a property name. CC is a algorithm lover other than English, so he gives a long string S to TIANKENG. The string S only contains eight kinds of letters-------‘A’, ‘B’, ‘C’, ‘D’, ‘E’, ‘F’, ‘G’, ‘H’. TIANKENG wants his restaurant’s name to be out of ordinary, so the restaurant’s name is a string T which should satisfy the following conditions: The string T should be as short as possible, if there are more than one strings which have the same shortest length, you should choose the string which has the minimum lexicographic order. Could you help TIANKENG get the name as soon as possible?

Meanwhile, T is different from all the substrings of S. Could you help TIANKENG get the name as soon as possible?

 

Input

The first line input file contains an integer T(T<=50) indicating the number of case.
In each test case:
Input a string S. the length of S is not large than 1000000.

 

Output

For each test case:
Output the string t satisfying the condition.(T also only contains eight kinds of letters-------‘A’, ‘B’, ‘C’, ‘D’, ‘E’, ‘F’, ‘G’, ‘H’.)

 

Sample Input

3

ABCDEFGH

AAABAACADAEAFAGAH

ACAC

 

Sample Output

AA

BB

B

 

因为只有8个字母 。

那么先枚举长度 （ i = 1 ~ 8 ）。

O(n)处理出该长度下主串存在的子串。

再枚举排列 （ j = 0 ~ i ! ）判存。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <algorithm>

using namespace std;

typedef long long LL;
typedef pair<int,int> pii;
const int N = ;
const int M = ;
const int inf = 1e9+;
const double eps = 1e-;
bool vis[M];
char str[N];
int a[N],f[N],len;

void get_s( int n , int cnt ,char *s) {
    for( int i = cnt- ; i >=  ; --i ){
        s[i] = (n%)+'A';
        n/=;
    }
    s[cnt] =  ;
}

int check( int n ) {
    int tmp =  ;
    if( len < n ) return -;
    for( int i =  ; i < f[n] ; ++i ) vis[i] = false ;
    for( int i =  ; i < n ; ++i )
        tmp = tmp *  + a[i] ;
    vis[tmp] = true ;
    for( int i = n ; i < len ; ++i ){
        tmp = ( tmp % f[n-] ) *  + a[i] ;
        vis[tmp] = true ;
    }
    for( int i =  ; i < f[n] ; ++i )if(!vis[i]){
        return i ;
    }
    return - ;
}

void Run(){
    scanf("%s",str); len = strlen(str);
    for( int i =  ; i < len ; ++i ) a[i] = str[i]-'A';
    for( int i =  ; i <=  ; ++i ){
        int res = check(i) ;
        if( res == - ) continue ;
        get_s(res,i,str) ;
        puts(str);
        return ;
    }
}

int main(){
    #ifdef LOCAL
        freopen("in.txt","r",stdin);
    #endif // LOCAL
    int tot =  , m =  ; f[] =  ;
    for( int i =  ; i <  ; ++i ) m *= ,f[tot++] = m ;
    int _ ; scanf("%d",&_);
    while( _-- ) Run();
}