Problem p01973 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>

#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#include <cassert>
#include <functional>

typedef long long ll;
using namespace std;

#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;

#define mod 1000000007              // 1e9+7(prime number)
#define INF 1000000000              // 1e9
#define LLINF 2000000000000000000LL // 2e18
#define SIZE 100010

/* Trie */

struct ACNode {
  int val;
  ACNode *next[26], *failure;

  ACNode() : val(0) { memset(next, 0, sizeof(next)); }

  void insert(char *s) {
    if (!*s) {
      val++;
      return;
    }
    int al = *s - 'a';
    if (next[al] == NULL)
      next[al] = new ACNode;
    next[al]->insert(s + 1);
  }

  ACNode *nextNode(char c) {
    int al = c - 'a';
    return next[al] ? next[al] : failure->nextNode(c);
  }
};

struct AhoCorasick {
  ACNode *node;

  AhoCorasick() { node = new ACNode; }

  void insert(char *s) { node->insert(s); }

  void build() {
    queue<ACNode *> que;

    node->failure = node;
    que.push(node);

    while (que.size()) {
      ACNode *p = que.front();
      que.pop();

      for (int i = 0; i < 26; i++) {
        if (p->next[i]) {
          ACNode *failure = p->failure;
          while (!failure->next[i] && failure != node) {
            failure = failure->failure;
          }
          if (failure->next[i] && !(failure == p && p == node)) {
            p->next[i]->failure = failure->next[i];
            p->next[i]->val += failure->next[i]->val;
          } else {
            p->next[i]->failure = node;
          }
          que.push(p->next[i]);
        }
      }
    }
  }
};

int main() {
  char s[SIZE], p[SIZE];
  int n;
  AhoCorasick ac;

  scanf("%s%d", s, &n);

  for (int i = 0; i < n; i++) {
    scanf("%s", p);
    ac.insert(p);
  }

  ac.build();

  ACNode *now = ac.node;
  int ans = 0;
  for (int i = 0; s[i] != '\0'; i++) {
    now = now->nextNode(s[i]);
    if (now->val) {
      ans++;
      now = ac.node;
    }
  }

  printf("%d\n", ans);

  return 0;
}


Fixed submission:
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>

#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#include <cassert>
#include <functional>

typedef long long ll;
using namespace std;

#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;

#define mod 1000000007              // 1e9+7(prime number)
#define INF 1000000000              // 1e9
#define LLINF 2000000000000000000LL // 2e18
#define SIZE 100010

/* Trie */

struct ACNode {
  int val;
  ACNode *next[26], *failure;

  ACNode() : val(0) { memset(next, 0, sizeof(next)); }

  void insert(char *s) {
    if (!*s) {
      val++;
      return;
    }
    int al = *s - 'a';
    if (next[al] == NULL)
      next[al] = new ACNode;
    next[al]->insert(s + 1);
  }

  ACNode *nextNode(char c) {
    int al = c - 'a';
    if (next[al])
      return next[al];
    return failure == this ? this : failure->nextNode(c);
  }
};

struct AhoCorasick {
  ACNode *node;

  AhoCorasick() { node = new ACNode; }

  void insert(char *s) { node->insert(s); }

  void build() {
    queue<ACNode *> que;

    node->failure = node;
    que.push(node);

    while (que.size()) {
      ACNode *p = que.front();
      que.pop();

      for (int i = 0; i < 26; i++) {
        if (p->next[i]) {
          ACNode *failure = p->failure;
          while (!failure->next[i] && failure != node) {
            failure = failure->failure;
          }
          if (failure->next[i] && !(failure == p && p == node)) {
            p->next[i]->failure = failure->next[i];
            p->next[i]->val += failure->next[i]->val;
          } else {
            p->next[i]->failure = node;
          }
          que.push(p->next[i]);
        }
      }
    }
  }
};

int main() {
  char s[SIZE], p[SIZE];
  int n;
  AhoCorasick ac;

  scanf("%s%d", s, &n);

  for (int i = 0; i < n; i++) {
    scanf("%s", p);
    ac.insert(p);
  }

  ac.build();

  ACNode *now = ac.node;
  int ans = 0;
  for (int i = 0; s[i] != '\0'; i++) {
    now = now->nextNode(s[i]);
    if (now->val) {
      ans++;
      now = ac.node;
    }
  }

  printf("%d\n", ans);

  return 0;
}