Buzzwords

input/code.cpp: In function 'void Test()':
input/code.cpp:92:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   92 |     freopen("temp\\in.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=500005, A = 27;
 
inline int Change(const char& c)
{
    int ret = c - 'a';
    if(ret < 0)
        ret = A - 1;
    return ret;
}
 
struct Trie
{
    int next[N][A], fail[N], end[N];
    int root, L;
    int NewNode()
    {
        for(int i=0; i<A; i++)
            next[L][i] = -1;
        end[L++] = 0;
        return L - 1;
    }
    void Init()
    {
        L = 0;
        root = NewNode();
    }
    void Insert(char buf[])
    {
        int len = strlen(buf);
        int now = root;
        for(int i=0; i<len; i++)
        {
            int cur = Change(buf[i]);
            if(next[now][cur] == -1)
                next[now][cur] = NewNode();
            now = next[now][cur];
        }
        end[now]++;
    }
    void Build()
    {
        queue<int> Q;
        fail[root] = root;
        for(int i=0; i<A; i++)
        {
            if(next[root][i] == -1)
                next[root][i] = root;
            else {
                fail[next[root][i]] = root;
                Q.push(next[root][i]);
            }
        }
        while( !Q.empty() )
        {
            int now = Q.front(); Q.pop();
            for(int i=0; i<A; i++)
            {
                if(next[now][i] == -1) {
                    next[now][i] = next[fail[now]][i];
                } else {
                    fail[next[now][i]] = next[fail[now]][i];
                    Q.push(next[now][i]);
                }
            }
        }
    }
    int Query(char buf[])
    {
        int len = strlen(buf);
        int now = root, res = 0;
        for(int i=0; i<len; i++)
        {
            now = next[now][Change(buf[i])];
            int temp = now;
            while(temp != root)
            {
                res += end[temp]; 
                // end[temp] = 0;
                temp = fail[temp];
            }
        }
        return res;
    }
}AC;
char str[N], buf[N];
 
void Test()
{
    freopen("temp\\in.txt", "r", stdin);
}
int main()
{
    // Test();
    cin.getline(str, N);
 
    int n;
    cin >> n; getchar();
    AC.Init();
    for(int i=1; i<=n; i++)
    {
        cin.getline(buf, N);
        AC.Insert(buf);
    }
    AC.Build();
 
    cout << AC.Query(str);
    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