Buzzwords

input/code.cpp: In constructor 'Node::Node()':
input/code.cpp:39:23: warning: iteration 26 invokes undefined behavior [-Waggressive-loop-optimizations]
   39 |             letter[i] = NULL;
      |                       ^
input/code.cpp:6:38: note: within this loop
    6 | #define REP(i,a,b) for (int i = a; i <= b; i++)
      |                                      ^
input/code.cpp:38:9: note: in expansion of macro 'REP'
   38 |         REP(i, 0, 26) {
      |         ^~~

#include <bits/stdc++.h>
 
using namespace std;
#define int long long
#define vout(x) for(int i=0;i<(long long)x.size();i++) printf("%lld ",x[i]);
#define REP(i,a,b) for (int i = a; i <= b; i++)
 
// g++ <filename>.cpp -g -Wall -Wextra -DDEBUG -o <executable>
 
// copied from: https://codeforces.com/blog/entry/79024
// === Debug macro starts here ===
 
int recur_depth = 0;
#ifdef DEBUG
#define dbg(x) {++recur_depth; auto x_=x; --recur_depth; cerr<<string(recur_depth, '\t')<<"\e[91m"<<__func__<<":"<<__LINE__<<"\t"<<#x<<" = "<<x_<<"\e[39m"<<endl;}
#else
#define dbg(x)
#endif
template<typename Ostream, typename Cont>
typename enable_if<is_same<Ostream,ostream>::value, Ostream&>::type operator<<(Ostream& os,  const Cont& v){
	os<<"[";
	for(auto& x:v){os<<x<<", ";}
	return os<<"]";
}
template<typename Ostream, typename ...Ts>
Ostream& operator<<(Ostream& os,  const pair<Ts...>& p){
	return os<<"{"<<p.first<<", "<<p.second<<"}";
}
 
// === Debug macro ends here ===
 
struct Node {
    Node *letter[26];
    bool end;
 
    Node() {
        end = false;
        REP(i, 0, 26) {
            letter[i] = NULL;
        }
    }
};
 
void insert(Node *root, string &s) {
    
    Node *current = root;
 
    for (auto c : s) {
 
        if (current->letter[c - 'a'] == NULL) {
            Node *node = new Node();
            current->letter[c - 'a'] = node;
        }
        current = current->letter[c - 'a'];
    }
 
    current->end = true;
}
 
bool search(Node *root, string &s) {
    
    Node *current = root;
 
    for (auto c : s) {
 
        dbg(c);
 
        if (current->letter[c - 'a'] == NULL) {
            return false;
        }
        current = current->letter[c - 'a'];
    }
 
    return current->end;
}
 
 
signed main() {
    
    int q;
    string s;
    getline(cin, s);
    cin >> q;
 
    Node *root = new Node();
    
    for (int i = 0; i < 1; i++) {
        string bw;
        cin >> bw;
        insert(root, bw);
    }
 
    stringstream s_stream(s);
    string word;
 
    int cnt = 0;
 
    while(s_stream >> word) {
        // dbg(search(root, word))
        if (search(root, word)) cnt++;
    }
 
    cout << cnt << "\n";
 
    return 0;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: WRONG ANSWER

Test 20

Verdict: WRONG ANSWER

Test 21

Verdict: WRONG ANSWER

Test 22

Verdict: WRONG ANSWER

Test 23

Verdict: WRONG ANSWER

Test 24

Verdict: WRONG ANSWER

Test 25

Verdict: WRONG ANSWER

Test 26

Verdict: WRONG ANSWER

Test 27

Verdict: WRONG ANSWER

Test 28

Verdict: WRONG ANSWER

Test 29

Verdict: WRONG ANSWER

Test 30

Verdict: WRONG ANSWER

Test 31

Verdict: WRONG ANSWER

Test 32

Verdict: WRONG ANSWER

Test 33

Verdict: WRONG ANSWER

Test 34

Verdict: WRONG ANSWER

Test 35

Verdict: WRONG ANSWER

Test 36

Verdict: WRONG ANSWER

Test 37

Verdict: WRONG ANSWER

Test 38

Verdict: WRONG ANSWER

Test 39

Verdict: WRONG ANSWER

Test 40

Verdict: WRONG ANSWER

Test 41

Verdict: WRONG ANSWER

Test 42

Verdict: WRONG ANSWER

Test 43

Verdict: WRONG ANSWER

Test 44

Verdict: WRONG ANSWER