Hat’s Words

http://acm.hdu.edu.cn/showproblem.php?pid=1247

C++版本一

字典树

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=10000000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q;
int ans,cnt,flag,temp;
int trie[N][26];
int tot;
bool en[N];
char s[50000+10][1000];
void insert(char *str){
    int len=strlen(str),p=0;
    for(int i=0;i<len;i++){
        int ch=str[i]-'a';
        if(trie[p][ch]==0)trie[p][ch]=++tot;
        p=trie[p][ch];
    }
    en[p]=1;
}
bool search(char *str,int len){
    int p=0;
    for(int i=0;i<len;i++){
        int ch=str[i]-'a';
        p=trie[p][ch];
        if(p==0)return 0;
    }
    return en[p];
}
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    //
    //scanf("%d",&t);
    while(~scanf("%s",s[++cnt])){
        insert(s[cnt]);
    }
    for(int i=1;i<=cnt;i++){
        int len=strlen(s[i]);
        for(int j=1;j<len;j++){
                //cout<<i<<search(s[i],j)<<search(s[i]+j,len-j)<<endl;
            if(search(s[i],j)&&search(s[i]+j,len-j)){
                printf("%s\n",s[i]);
                break;
            }
        }
    }

    //cout << "Hello world!" << endl;
    return 0;
}