test/verify/yukicoder-430.test.cpp

• View this file on GitHub
• Last update: 2024-05-01 23:44:47+09:00
• Problem: https://yukicoder.me/problems/no/430

Depends on

• Aho-Corasick(エイホ–コラシック法) (string/aho-corasick.hpp)
• structure/trie/trie.hpp
• template/template.hpp

Code

// competitive-verifier: PROBLEM https://yukicoder.me/problems/no/430

#include "../../template/template.hpp"

#include "../../structure/trie/trie.hpp"

#include "../../string/aho-corasick.hpp"

int main() {
  string S;
  int M;
  cin >> S;
  cin >> M;
  AhoCorasick< 26, 'A' > aho;
  for(int i = 0; i < M; i++) {
    string T;
    cin >> T;
    aho.add(T);
  }
  aho.build();
  cout << aho.move(S).first << endl;
}

#line 1 "test/verify/yukicoder-430.test.cpp"
// competitive-verifier: PROBLEM https://yukicoder.me/problems/no/430

#line 1 "template/template.hpp"
#include <bits/stdc++.h>

using namespace std;

using int64 = long long;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;

template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << p.first << " " << p.second;
  return os;
}

template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < (int)v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &in : v) is >> in;
  return is;
}

template <typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}

template <typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}

template <typename T = int64>
vector<T> make_v(size_t a) {
  return vector<T>(a);
}

template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
  t = v;
}

template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
  for (auto &e : t) fill_v(e, v);
}

template <typename F>
struct FixPoint : F {
  explicit FixPoint(F &&f) : F(forward<F>(f)) {}

  template <typename... Args>
  decltype(auto) operator()(Args &&...args) const {
    return F::operator()(*this, forward<Args>(args)...);
  }
};

template <typename F>
inline decltype(auto) MFP(F &&f) {
  return FixPoint<F>{forward<F>(f)};
}
#line 4 "test/verify/yukicoder-430.test.cpp"

#line 1 "structure/trie/trie.hpp"
template <int char_size>
struct TrieNode {
  int nxt[char_size];

  int exist;
  vector<int> accept;

  TrieNode() : exist(0) { memset(nxt, -1, sizeof(nxt)); }
};

template <int char_size, int margin>
struct Trie {
  using Node = TrieNode<char_size>;

  vector<Node> nodes;
  int root;

  Trie() : root(0) { nodes.push_back(Node()); }

  void update_direct(int node, int id) { nodes[node].accept.push_back(id); }

  void update_child(int node, int child, int id) { ++nodes[node].exist; }

  void add(const string &str, int str_index, int node_index, int id) {
    if (str_index == str.size()) {
      update_direct(node_index, id);
    } else {
      const int c = str[str_index] - margin;
      if (nodes[node_index].nxt[c] == -1) {
        nodes[node_index].nxt[c] = (int)nodes.size();
        nodes.push_back(Node());
      }
      add(str, str_index + 1, nodes[node_index].nxt[c], id);
      update_child(node_index, nodes[node_index].nxt[c], id);
    }
  }

  void add(const string &str, int id) { add(str, 0, 0, id); }

  void add(const string &str) { add(str, nodes[0].exist); }

  void query(const string &str, const function<void(int)> &f, int str_index,
             int node_index) {
    for (auto &idx : nodes[node_index].accept) f(idx);
    if (str_index == str.size()) {
      return;
    } else {
      const int c = str[str_index] - margin;
      if (nodes[node_index].nxt[c] == -1) return;
      query(str, f, str_index + 1, nodes[node_index].nxt[c]);
    }
  }

  void query(const string &str, const function<void(int)> &f) {
    query(str, f, 0, 0);
  }

  int count() const { return (nodes[0].exist); }

  int size() const { return ((int)nodes.size()); }
};
#line 6 "test/verify/yukicoder-430.test.cpp"

#line 1 "string/aho-corasick.hpp"
/**
 * @brief Aho-Corasick(エイホ–コラシック法)
 *
 */
template <int char_size, int margin>
struct AhoCorasick : Trie<char_size + 1, margin> {
  using Trie<char_size + 1, margin>::Trie;

  const int FAIL = char_size;
  vector<int> correct;

  void build(bool heavy = true) {
    correct.resize(this->size());
    for (int i = 0; i < this->size(); i++) {
      correct[i] = (int)this->nodes[i].accept.size();
    }
    queue<int> que;
    for (int i = 0; i <= char_size; i++) {
      if (~this->nodes[0].nxt[i]) {
        this->nodes[this->nodes[0].nxt[i]].nxt[FAIL] = 0;
        que.emplace(this->nodes[0].nxt[i]);
      } else {
        this->nodes[0].nxt[i] = 0;
      }
    }
    while (!que.empty()) {
      auto &now = this->nodes[que.front()];
      int fail = now.nxt[FAIL];
      correct[que.front()] += correct[fail];
      que.pop();
      for (int i = 0; i < char_size; i++) {
        if (~now.nxt[i]) {
          this->nodes[now.nxt[i]].nxt[FAIL] = this->nodes[fail].nxt[i];
          if (heavy) {
            auto &u = this->nodes[now.nxt[i]].accept;
            auto &v = this->nodes[this->nodes[fail].nxt[i]].accept;
            vector<int> accept;
            set_union(begin(u), end(u), begin(v), end(v),
                      back_inserter(accept));
            u = accept;
          }
          que.emplace(now.nxt[i]);
        } else {
          now.nxt[i] = this->nodes[fail].nxt[i];
        }
      }
    }
  }

  map<int, int> match(const string &str, int now = 0) {
    map<int, int> result;
    for (auto &c : str) {
      now = this->nodes[now].nxt[c - margin];
      for (auto &v : this->nodes[now].accept) result[v] += 1;
    }
    return result;
  }

  pair<int64_t, int> move(const char &c, int now = 0) {
    now = this->nodes[now].nxt[c - margin];
    return {correct[now], now};
  }

  pair<int64_t, int> move(const string &str, int now = 0) {
    int64_t sum = 0;
    for (auto &c : str) {
      auto nxt = move(c, now);
      sum += nxt.first;
      now = nxt.second;
    }
    return {sum, now};
  }
};
#line 8 "test/verify/yukicoder-430.test.cpp"

int main() {
  string S;
  int M;
  cin >> S;
  cin >> M;
  AhoCorasick< 26, 'A' > aho;
  for(int i = 0; i < M; i++) {
    string T;
    cin >> T;
    aho.add(T);
  }
  aho.build();
  cout << aho.move(S).first << endl;
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	challenge01.txt	AC	6 ms	4 MB
g++	challenge02.txt	AC	13 ms	8 MB
g++	challenge03.txt	AC	8 ms	5 MB
g++	challenge04.txt	AC	8 ms	5 MB
g++	sample1.txt	AC	6 ms	4 MB
g++	sample2.txt	AC	6 ms	4 MB
g++	sample3.txt	AC	6 ms	4 MB
g++	sample4.txt	AC	6 ms	4 MB
g++	test1.txt	AC	6 ms	4 MB
g++	test10.txt	AC	9 ms	6 MB
g++	test2.txt	AC	6 ms	4 MB
g++	test3.txt	AC	6 ms	4 MB
g++	test4.txt	AC	10 ms	7 MB
g++	test5.txt	AC	12 ms	6 MB
g++	test6.txt	AC	11 ms	6 MB
g++	test7.txt	AC	10 ms	6 MB
g++	test8.txt	AC	9 ms	6 MB
g++	test9.txt	AC	9 ms	6 MB
clang++	challenge01.txt	AC	6 ms	4 MB
clang++	challenge02.txt	AC	14 ms	10 MB
clang++	challenge03.txt	AC	8 ms	5 MB
clang++	challenge04.txt	AC	8 ms	5 MB
clang++	sample1.txt	AC	6 ms	4 MB
clang++	sample2.txt	AC	6 ms	4 MB
clang++	sample3.txt	AC	6 ms	4 MB
clang++	sample4.txt	AC	6 ms	4 MB
clang++	test1.txt	AC	6 ms	4 MB
clang++	test10.txt	AC	9 ms	6 MB
clang++	test2.txt	AC	6 ms	4 MB
clang++	test3.txt	AC	6 ms	4 MB
clang++	test4.txt	AC	10 ms	6 MB
clang++	test5.txt	AC	10 ms	7 MB
clang++	test6.txt	AC	11 ms	6 MB
clang++	test7.txt	AC	9 ms	7 MB
clang++	test8.txt	AC	9 ms	6 MB
clang++	test9.txt	AC	10 ms	6 MB

Back to top page