Buzzwords

#include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <unordered_map>

using namespace std;

struct TrieNode {
    unordered_map<char, TrieNode*> children;
    TrieNode* failLink = nullptr;
    int outputCount = 0;
    bool isEnd = false;
};

void insertPattern(TrieNode* root, const string& pattern) {
    TrieNode* current = root;
    for (char c : pattern) {
        if (current->children.find(c) == current->children.end()) {
            current->children[c] = new TrieNode();
        }
        current = current->children[c];
    }
    current->isEnd = true;
    current->outputCount++; 
}

void buildFailureLinks(TrieNode* root) {
    queue<TrieNode*> q;
    root->failLink = root; 
    for (auto& child : root->children) {
        child.second->failLink = root;
        q.push(child.second);
    }

    while (!q.empty()) {
        TrieNode* current = q.front();
        q.pop();

        for (auto& child : current->children) {
            char ch = child.first;
            TrieNode* nextNode = child.second;

            TrieNode* fail = current->failLink;
            while (fail != root && fail->children.find(ch) == fail->children.end()) {
                fail = fail->failLink;
            }
            if (fail->children.find(ch) != fail->children.end()) {
                nextNode->failLink = fail->children[ch];
            } else {
                nextNode->failLink = root;
            }
            
            nextNode->outputCount += nextNode->failLink->outputCount;
            q.push(nextNode);
        }
    }
}

int searchText(TrieNode* root, const string& text) {
    TrieNode* current = root;
    int totalCount = 0;

    for (char c : text) {
        while (current != root && current->children.find(c) == current->children.end()) {
            current = current->failLink;
        }
        if (current->children.find(c) != current->children.end()) {
            current = current->children[c];
        }

        if (current->isEnd || current->outputCount > 0) {
            totalCount += current->outputCount;
        }
    }
    return totalCount;
}



int main() {
    string text;
    getline(cin, text);
    int q;
    cin >> q;
    cin.ignore();

    TrieNode* root = new TrieNode();

    for (int i = 0; i < q; i++) {
        string buzzword;
        getline(cin, buzzword);
        insertPattern(root, buzzword);
    }

    buildFailureLinks(root);

    int result = searchText(root, text);
    cout << result << endl;


    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED

Test 33

Verdict: ACCEPTED

Test 34

Verdict: ACCEPTED

Test 35

Verdict: ACCEPTED

Test 36

Verdict: ACCEPTED

Test 37

Verdict: ACCEPTED

Test 38

Verdict: ACCEPTED

Test 39

Verdict: ACCEPTED

Test 40

Verdict: ACCEPTED

Test 41

Verdict: ACCEPTED

Test 42

Verdict: ACCEPTED

Test 43

Verdict: ACCEPTED

Test 44

Verdict: ACCEPTED