Buzzwords

input/code.cpp: In member function 'void AhoCorasick::buildFailLinks()':
input/code.cpp:36:20: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   36 |         for (auto& [ch, child] : root->children) {
      |                    ^
input/code.cpp:45:24: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   45 |             for (auto& [ch, child] : current->children) {
      |                        ^

#include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <unordered_map>
using namespace std;

struct TrieNode {
    unordered_map<char, TrieNode*> children;
    TrieNode* failLink = nullptr;
    vector<int> output;
};

class AhoCorasick {
private:
    TrieNode* root;
    vector<int> wordCount;

public:
    AhoCorasick(int totalWords) : root(new TrieNode()), wordCount(totalWords, 0) {}

    void insert(const string& word, int index) {
        TrieNode* current = root;
        for (char ch : word) {
            if (!current->children.count(ch))
                current->children[ch] = new TrieNode();
            current = current->children[ch];
        }
        current->output.push_back(index);
    }

    void buildFailLinks() {
        queue<TrieNode*> q;
        root->failLink = root;

        for (auto& [ch, child] : root->children) {
            child->failLink = root;
            q.push(child);
        }

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

            for (auto& [ch, child] : current->children) {
                TrieNode* fail = current->failLink;
                while (fail != root && !fail->children.count(ch))
                    fail = fail->failLink;

                if (fail->children.count(ch))
                    child->failLink = fail->children[ch];
                else
                    child->failLink = root;

                child->output.insert(child->output.end(),
                                     child->failLink->output.begin(),
                                     child->failLink->output.end());

                q.push(child);
            }
        }
    }

    void search(const string& text) {
        TrieNode* current = root;

        for (char ch : text) {
            while (current != root && !current->children.count(ch))
                current = current->failLink;

            if (current->children.count(ch))
                current = current->children[ch];
            else
                current = root;

            for (int index : current->output) {
                wordCount[index]++;
            }
        }
    }

    int getTotalMatches() {
        int total = 0;
        for (int count : wordCount)
            total += count;
        return total;
    }
};

int main() {
    string s;
    getline(cin, s);

    int q;
    cin >> q;
    cin.ignore();

    AhoCorasick ahoCorasick(q);

    for (int i = 0; i < q; ++i) {
        string buzzword;
        getline(cin, buzzword);
        ahoCorasick.insert(buzzword, i);
    }

    ahoCorasick.buildFailLinks();
    ahoCorasick.search(s);

    cout << ahoCorasick.getTotalMatches() << 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