Repository HDU - 2846 （字典树）

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

题目大意：把每个单词X1X2X3……分别以X1，X2，X3为开头存入字典树中，然后要进行标记，同一个单词不能多次计数

/*
@Author: Top_Spirit
@Language: C++
*/
//#include <bits/stdc++.h>
#include <iostream>
#include <cstring>
using namespace std ;
typedef long long ll ;
const int Maxn = 2e6 +10 ;
const int tim = 250 ;
const double eps = 1e-6 ;

int P, Q ;
string s ;

struct Tree{
    Tree *Next[26] ;
    int flag ; // 最后一次经过此结点的单词id
    int num ; // 记录单词个数
    Tree(){
        for (int i = 0; i <26; i++) Next[i] = NULL ;
        flag = -1 ;
        num = 0 ;
    }
};

Tree *root = new Tree();

void Insert(char *str, int k){
    Tree *p = root ;
    for (int i = 0; i < str[i]; i++){
        int id = str[i] - 'a' ;
        if (p -> Next[id] == NULL) {
            p -> Next[id] = new Tree() ;
        }
        p = p -> Next[id] ;
        if (p -> flag != k){
            p -> num++ ;
        }
        p -> flag = k ;
//        cout << p -> num << endl ;
    }
}

int Find(char *str){
    Tree *p = root ;
    for (int i = 0; str[i]; i++){
        int id= str[i] - 'a' ;
        if (p -> Next[id] == NULL) return 0 ;
        p = p -> Next[id] ;
    }
    return p -> num ;
}

void fr(Tree *p){
    for (int i = 0; i < 26; i++){
        if (p -> Next[i] != nullptr) {
            fr(p -> Next[i]) ;
        }
    }
    delete p ;
}

int main (){
    cin >> P ;
    char s[25] ;
    for (int j = 0; j < P; j++){
        cin >> s ;
//        cout << "++++" << s <<  endl ;
        int len = strlen(s) ;
        for (int i = 0; i < len; i++){
//            cout << "______-" << s + i << endl ;
            Insert(s + i, j) ;
        }
    }
    cin >> Q ;
    while (Q--){
        cin >> s ;
//        cout << s << endl ;
        int ans = Find(s) ;
        cout << ans << endl ;
    }
    fr(root) ;
    return 0 ;
}