STL_Algorithms/TRIE.cpp at master · ashryaagr/STL_Algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

const ll SIZE = 26;

struct node{
	ll count;
	node* ar[SIZE];
};

node* getNode()
{
	node* n = new node;
	n->count=0;

	for(ll i=0;i<SIZE;i++)
	n->ar[i] = NULL;

	return n;
}

void insert(node *root , string st)
{
	node *tempRoot = root;

	for(ll i=0;i<st.size();i++)
	{
		ll index = st[i] - 'a';

		if(tempRoot->ar[index] == NULL)
		tempRoot->ar[index] = getNode();

		tempRoot = tempRoot->ar[index];
		tempRoot->count++;
	}

// 	tempRoot->endOfWord = true;
}

ll search(node *root , string st)
{
	node *tempRoot = root;

	for(ll i=0;i<st.size();i++)
	{
		ll index = st[i] - 'a';

		if(tempRoot->ar[index] == NULL)
		return 0;

		tempRoot = tempRoot->ar[index];
	}

	return tempRoot->count;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    node* root=getNode();

    ll n,q;
    cin>>n>>q;
    while(n--)
    {
        string s;
        cin>>s;
        insert(root,s);
    }
    while(q--)
    {
        string s;
        cin>>s;
        cout<<search(root,s)<<'\n';
    }
    return 0;
}