ADAINDEX.cpp

/*Let's get high :D*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
#define MOD                 1000000007LL
#define EPS                 1e-9
#define io                  ios_base::sync_with_stdio(false);cin.tie(NULL);
#define M_PI                3.14159265358979323846

template <typename T> T gcd(T a, T b){return (b==0)?a:gcd(b,a%b);}
template <typename T> T lcm(T a, T b){return a*(b/gcd(a,b));}
template <typename T> T mod_exp(T b, T p, T m){T x = 1;while(p){if(p&1)x=(x*b)%m;b=(b*b)%m;p=p>>1;}return x;}
template <typename T> T invFermat(T a, T p){return mod_exp(a, p-2, p);}
template <typename T> T exp(T b, T p){T x = 1;while(p){if(p&1)x=(x*b);b=(b*b);p=p>>1;}return x;}

const int MAXN = 26;

struct Trie{
    int words;
    int prefixes;
    Trie* edges[26];
    Trie(){
        words = 0;
        prefixes = 0;
        for(int i = 0;i < MAXN; i++)
            edges[i] = NULL;
    }
};

Trie root;

void addWord(Trie* vertex, int idx, string &word){
    if(idx == word.size()){
        vertex->prefixes++;
        vertex->words++;
        return;
    }
    vertex->prefixes++;
    if(vertex->edges[word[idx]-'a'] == NULL)
        vertex->edges[word[idx]-'a'] = new Trie;
    addWord(vertex->edges[word[idx]-'a'], idx+1, word);
}

int countWords(Trie* vertex, int idx, string &word){
    if(idx == word.size())
        return vertex->words;
    if(vertex->edges[word[idx]-'a'] == NULL)
        return 0;
    return countWords(vertex->edges[word[idx]-'a'], idx+1, word);
}

int countPrefixes(Trie* vertex, int idx, string &word){
    if(idx == word.size())
        return vertex->prefixes;
    if(vertex->edges[word[idx]-'a'] == NULL)
        return 0;
    return countPrefixes(vertex->edges[word[idx]-'a'], idx+1, word);
}

void init(){
    root.words = 0;
    root.prefixes = 0;
    for(int i = 0;i < MAXN; i++)
        root.edges[i] = NULL;
}

int main(){
    io;
    init();
    int n, q;
    cin >> n >> q;
    for(int i = 0;i < n; i++){
    	string s;
    	cin >> s;
    	addWord(&root, 0, s);
    }
    while(q--){
    	string s;
    	cin >> s;
    	cout << countPrefixes(&root, 0, s) << endl;
    }
    return 0;
}