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

HDU 4886 TIANKENG’s restaurant(Ⅱ)【hash+暴力】http://acm.hdu.edu.cn/showproblem.php?pid=4886

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
  
  

 

Source

BestCoder Round #2

 

【题意】饭店起名字，已知一个字符串S，找一个字符串T使其满足：不是S的任一子串，且找到最短的串，长度相同输出字典序最小的~

【思路】hash+暴力：暴力枚举S的所有子串的值映射成9进制数，进行标记，找到没出现的最小的9进制换算成字符串输出~

【代码如下】

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int maxn = 1000005;
int n,f[10],vis[maxn];
char str[maxn];

bool solve(int k)
{
    memset(vis, 0, sizeof(vis));
    int tmp = 0;
    for(int i=0; i<k; i++)
        tmp = tmp*8 + str[i]-'A';
    vis[tmp] = 1;
    for(int i=k; i<n; i++){
        tmp = tmp%f[k-1];
        tmp = tmp*8 + str[i]-'A';
        vis[tmp] = 1;
    }
    int x = 0;
    while(vis[x]) x++;

    if(x < f[k]){
        for(int i=k-1; i>=0; i--){
            printf("%c", x/f[i]+'A');
            x %= f[i];
        }
        printf("\n");
        return true;
    }
    return false;
}

int main()
{
    int cas;
    scanf("%d",&cas);
    f[0] = 1;
    for(int i=1; i<=8; i++)
        f[i] = f[i-1] * 8;
    while(cas--)
    {
        scanf("%s",str);
        n = strlen(str);
        int i=1;
        while(!solve(i)) i++;
    }
    return 0;
}