[HDU2846]Repository

Time Limit: 2000/1000 MS (Java/Others)
Memory Limit: 65536/65536 K (Java/Others)

Problem Description

When you go shopping, you can search in repository for avalible merchandises by the computers and internet. First you give the search system a name about something, then the system responds with the results. Now you are given a lot merchandise names in repository and some queries, and required to simulate the process.

Input

There is only one case. First there is an integer $P (1<=P<=10000)$representing the number of the merchanidse names in the repository. The next P lines each contain a string (it’s length isn’t beyond 20,and all the letters are lowercase).Then there is an integer$Q(1<=Q<=100000)$representing the number of the queries. The next Q lines each contains a string(the same limitation as foregoing descriptions) as the searching condition.

Output

For each query, you just output the number of the merchandises, whose names contain the search string as their substrings.

Sample Input

20
ad
ae
af
ag
ah
ai
aj
ak
al
ads
add
ade
adf
adg
adh
adi
adj
adk
adl
aes
5
b
a
d
ad
s

Sample Output

0
20
11
11
2

题意：
给你一个由P个字符串组成的字典，长度不超过20。接下来有Q组询问，每组询问一个字符串，问这个字符串是字典中多少个字符串的子串。

题解：
对于每个插入的字符串，我们将其所有后缀插入trie树，然后在trie树的每个节点都记录该节点属于多少个字符串。用相同编号来统一同一个字符串的不同后缀。

#include<bits/stdc++.h>
#define LiangJiaJun main
using namespace std;
int ch[500004][26];
int cnt[500004],last[500004],sz;
int p,q;
int insert(char *s,int be,int ed,int value){
    int u=0,to;
    for(int i=be;i<=ed;i++){
        to=s[i]-'a';
        if(!ch[u][to]){
            ch[u][to]=sz++;
        }
        u=ch[u][to];
        if(last[u]!=value){
            last[u]=value;
            ++cnt[u];
        }
    }
    return 0;
}
int find(char *s,int be,int ed){
    int u=0,to;
    for(int i=be;i<=ed;i++){
        to=s[i]-'a';
        if(!ch[u][to])return 0;
        u=ch[u][to];
    }
    return cnt[u];
}
char s[24];
int w33ha(){
    sz=1;
    scanf("%d",&p);
    for(int i=1;i<=p;i++){
        scanf("%s",s+1);
        int l=strlen(s+1);
        for(int j=1;j<=l;j++)insert(s,j,l,i);
    }
    scanf("%d",&q);
    while(q--){
        scanf("%s",s+1);
        int l=strlen(s+1);
        printf("%d\n",find(s,1,l));
    }
    return 0;
}
int LiangJiaJun(){
    w33ha();
    return 0;
}