結果
問題 | No.430 文字列検索 |
ユーザー |
![]() |
提出日時 | 2024-07-26 18:46:57 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 10 ms / 2,000 ms |
コード長 | 8,232 bytes |
コンパイル時間 | 2,511 ms |
コンパイル使用メモリ | 216,396 KB |
実行使用メモリ | 8,160 KB |
最終ジャッジ日時 | 2024-11-10 01:11:53 |
合計ジャッジ時間 | 2,695 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 14 |
ソースコード
#line 1 "main.cpp"#include<bits/stdc++.h>//#pragma GCC target("avx,avx2")//#pragma GCC optimize("O3")//#pragma GCC optimize("unroll-loops")#ifdef LOCAL#include <debug.hpp>#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)#else#define debug(...) (static_cast<void>(0))#endifusing namespace std;using ll = long long;using ull = unsigned long long;using ld = long double;using pll = pair<ll,ll>;using pii = pair<int,int>;using vi = vector<int>;using vvi = vector<vi>;using vvvi = vector<vvi>;using vl = vector<ll>;using vvl = vector<vl>;using vvvl = vector<vvl>;using vul = vector<ull>;using vpii = vector<pii>;using vvpii = vector<vpii>;using vpll = vector<pll>;using vs = vector<string>;template<class T> using pq = priority_queue<T,vector<T>, greater<T>>;#define overload4(_1, _2, _3, _4, name, ...) name#define overload3(a,b,c,name,...) name#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)#define rep2(i, n) for (ll i = 0; i < (n); ++i)#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)#define all1(i) begin(i) , end(i)#define all2(i,a) begin(i) , begin(i) + a#define all3(i,a,b) begin(i) + a , begin(i) + b#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)#define sum(...) accumulate(all(__VA_ARGS__),0LL)template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }template<class T> auto min(const T& a){return *min_element(all(a));}template<class T> auto max(const T& a){return *max_element(all(a));}template<class... Ts> void in(Ts&... t);#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)#define VEC(type, name, size) vector<type> name(size); in(name)#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)ll intpow(ll a, ll b){ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }bool is_clamp(ll val,ll low,ll high) {return low <= val && val < high;}void Yes() {cout << "Yes\n";return;}void No() {cout << "No\n";return;}void YES() {cout << "YES\n";return;}void NO() {cout << "NO\n";return;}template <typename T>T floor(T a, T b) {return a / b - (a % b && (a ^ b) < 0);}template <typename T>T ceil(T x, T y) {return floor(x + y - 1, y);}template <typename T>T bmod(T x, T y) {return x - y * floor(x, y);}template <typename T>pair<T, T> divmod(T x, T y) {T q = floor(x, y);return {q, x - q * y};}namespace IO{#define VOID(a) decltype(void(a))struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(15);}} setting;template<int I> struct P : P<I-1>{};template<> struct P<0>{};template<class T> void i(T& t){ i(t, P<3>{}); }void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){in(get<idx>(t)...);}template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ituple(t, make_index_sequence<tuple_size<T>::value>{});}#undef VOID}#define unpack(a) (void)initializer_list<int>{(a, 0)...}template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }#undef unpackconstexpr long double PI = 3.141592653589793238462643383279L;template <class F> struct REC {F f;REC(F &&f_) : f(forward<F>(f_)) {}template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};constexpr int mod = 998244353;//constexpr int mod = 1000000007;#line 2 "library/string/trie.hpp"template <size_t X = 26,char margin = 'a'>struct Trie {struct Node {array<int, X> nxt;vector<int> idxs;int idx;char key;Node(char c): idx(-1),key(c) {fill(nxt.begin(),nxt.end(),-1);}};vector<Node> st;Trie(char c = '$') {st.emplace_back(c);}inline int &next(int i,int j) {return st[i].nxt[j];}int add(const string &s,int x) {int pos = 0;for(int i = 0;i < (int)s.size();i++) {int k = s[i] - margin;if(~next(pos,k)) {pos = next(pos,k);continue;}int npos = st.size();next(pos,k) = npos;st.emplace_back(s[i]);pos = npos;}st[pos].idx = x;st[pos].idxs.emplace_back(x);return pos;}int find(const string &s) {int pos = 0;for(int i = 0;i < (int)s.size();i++) {int k = s[i] - margin;if(next(pos,k) < 0) return -1;pos = next(pos,k);}return pos;}int move(int pos,char c) {assert(pos < (int)st.size());return pos < 0 ? -1:next(pos,c - margin);}int size() const {return st.size();}int idx(int pos) {return pos < 0 ? -1:st[pos].idx;}vector<int> idxs(int pos) { return pos < 0 ? vector<int>() : st[pos].idxs; }};#line 3 "library/string/AhoCorasick.hpp"template <size_t X = 26, char margin = 'a'>struct AhoCorasick : Trie<X + 1, margin> {using TRIE = Trie<X + 1, margin>;using TRIE::next;using TRIE::st;using TRIE::add;using TRIE::TRIE;vector<int> cnt;vector<int> last;vector<int> BFS;vector<int> suffix_link;void add(const string &s) {int pos = add(s,(int)last.size());last.emplace_back(pos);}void build() {int n = st.size();cnt.resize(n);suffix_link.resize(n);for (int i = 0; i < n; i++) {cnt[i] = (int)st[i].idxs.size();}queue<int> que;for (int i = 0; i < (int)X; i++) {if (~next(0, i)) {next(next(0, i), X) = 0;que.emplace(next(0, i));} else {next(0, i) = 0;}}BFS.clear();while (!que.empty()) {auto &x = st[que.front()];int fail = x.nxt[X];cnt[que.front()] += cnt[fail];que.pop();for (int i = 0; i < (int)X; i++) {int &nx = x.nxt[i];if (nx < 0) {nx = next(fail, i);continue;}BFS.emplace_back(nx);suffix_link[nx] = next(fail,i);que.emplace(nx);next(nx, X) = next(fail, i);}}reverse(BFS.begin(),BFS.end());}vector<int> match(string s,int heavy = true) {vector<int> res;if(heavy) {vector<int> visit_cnt(TRIE::size());int pos = 0;for(auto &c:s) {pos = next(pos, c - margin);visit_cnt[pos]++;}res.assign(last.size(),0);for(auto &x:BFS) {visit_cnt[suffix_link[x]] += visit_cnt[x];}for(int i = 0,size = last.size();i < size;++i) {res[i] = visit_cnt[last[i]];}}else {res.assign(1,0);int pos = 0;for(auto &c:s) {pos = next(pos, c - margin);res[0] += cnt[pos];}}return res;}int count(int pos) { return cnt[pos]; }};#line 99 "main.cpp"int main() {STR(s);AhoCorasick<26,'A'> aho;INT(q);vs T(q);rep(i,q) {STR(t);aho.add(t);T[i] = t;}aho.build();vi ret = aho.match(s,false);cout << ret[0] << '\n';}