結果

問題 No.430 文字列検索
ユーザー rniyarniya
提出日時 2020-10-28 20:40:24
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 17 ms / 2,000 ms
コード長 5,856 bytes
コンパイル時間 2,474 ms
コンパイル使用メモリ 216,240 KB
実行使用メモリ 7,624 KB
最終ジャッジ日時 2023-09-29 03:45:45
合計ジャッジ時間 3,588 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 17 ms
7,624 KB
testcase_02 AC 5 ms
4,520 KB
testcase_03 AC 5 ms
4,380 KB
testcase_04 AC 2 ms
4,380 KB
testcase_05 AC 1 ms
4,376 KB
testcase_06 AC 2 ms
4,376 KB
testcase_07 AC 1 ms
4,380 KB
testcase_08 AC 2 ms
4,376 KB
testcase_09 AC 2 ms
4,376 KB
testcase_10 AC 1 ms
4,376 KB
testcase_11 AC 11 ms
5,848 KB
testcase_12 AC 12 ms
6,396 KB
testcase_13 AC 12 ms
6,500 KB
testcase_14 AC 10 ms
5,664 KB
testcase_15 AC 8 ms
5,136 KB
testcase_16 AC 7 ms
5,132 KB
testcase_17 AC 7 ms
5,092 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define LOCAL
#pragma region Macros
typedef long long ll;
#define ALL(x) (x).begin(),(x).end()
const long long MOD=1000000007;
// const long long MOD=998244353;
const int INF=1e9;
const long long IINF=1e18;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
const char dir[4]={'D','R','U','L'};

template<typename T>
istream &operator>>(istream &is,vector<T> &v){
    for (T &x:v) is >> x;
    return is;
}
template<typename T>
ostream &operator<<(ostream &os,const vector<T> &v){
    for (int i=0;i<v.size();++i){
        os << v[i] << (i+1==v.size()?"": " ");
    }
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const pair<T,U> &p){
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const map<T,U> &m){
    os << '{';
    for (auto itr=m.begin();itr!=m.end();++itr){
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr!=m.end()) os << ',';
        --itr;
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const set<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();++itr){
        os << *itr;
        if (++itr!=s.end()) os << ',';
        --itr;
    }
    os << '}';
    return os;
}

void debug_out(){cerr << '\n';}
template<class Head,class... Tail>
void debug_out(Head&& head,Tail&&... tail){
    cerr << head;
    if (sizeof...(Tail)>0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...) cerr << " ";\
cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n';\
cerr << " ";\
debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;}
template<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;}

template<class T1,class T2> inline bool chmin(T1 &a,T2 b){
    if (a>b){a=b; return true;} return false;
}
template<class T1,class T2> inline bool chmax(T1 &a,T2 b){
    if (a<b){a=b; return true;} return false;
}
#pragma endregion

template<int char_size>
struct Trie{
    struct TrieNode{
        char c; int dep;
        vector<int> nxt,idxs;
        TrieNode(char c,int dep):c(c),dep(dep),nxt(char_size,-1){}
    };
    vector<TrieNode> Nodes;
    function<int(char)> ctoi;
    Trie(function<int(char)> ctoi):ctoi(ctoi){
        Nodes.emplace_back('$',0);
    }
    inline int &next(int node,int c){
        return Nodes[node].nxt[c];
    }
    inline int &next(int node,char c){
        return next(node,ctoi(c));
    }
    void add(const string &s,int x=0){
        int node=0;
        for (int i=0;i<s.size();++i){
            int k=ctoi(s[i]);
            if (next(node,k)<0){
                next(node,k)=Nodes.size();
                Nodes.emplace_back(s[i],i+1);
            }
            node=next(node,k);
        }
        Nodes[node].idxs.emplace_back(x);
    }
    int find(const string &s){
        int node=0;
        for (int i=0;i<s.size();++i){
            int k=ctoi(s[i]);
            if (next(node,k)<0) return -1;
            node=next(node,k);
        }
        return node;
    }
    template<typename F>
    void query(const string &s,const F &f,int l){
        int node=0;
        for (int i=l;i<s.size();++i){
            node=next(node,s[i]);
            if (node<0) return;
            for (auto &idx:Nodes[node].idxs) f(idx);
        }
    }
    int size(){return Nodes.size();};
    vector<int> idxs(int node){return Nodes[node].idxs;}
};

template<int char_size>
struct AhoCorasick:Trie<char_size+1>{
    using Trie<char_size+1>::Trie;
    using Trie<char_size+1>::next;
    using Trie<char_size+1>::ctoi;
    const int FAIL=char_size;
    vector<int> cnt;
    void build(bool heavy=true){
        auto &Nodes=this->Nodes;
        cnt.resize(Nodes.size());
        for (int i=0;i<Nodes.size();++i){
            cnt[i]=Nodes[i].idxs.size();
        }
        queue<int> que;
        for (int i=0;i<=char_size;++i){
            if (~next(0,i)){
                next(next(0,i),FAIL)=0;
                que.emplace(next(0,i));
            } else next(0,i)=0;
        }
        while (!que.empty()){
            auto &node=Nodes[que.front()];
            int fail=node.nxt[FAIL];
            cnt[que.front()]+=cnt[fail];
            que.pop();
            for (int i=0;i<char_size;++i){
                if (~node.nxt[i]){
                    next(node.nxt[i],FAIL)=next(fail,i);
                    if (heavy){
                        auto &u=Nodes[node.nxt[i]].idxs;
                        auto &v=Nodes[next(fail,i)].idxs;
                        vector<int> w;
                        set_union(u.begin(),u.end(),v.begin(),v.end(),back_inserter(w));
                        u=w;
                    }
                    que.emplace(node.nxt[i]);
                } else node.nxt[i]=Nodes[fail].nxt[i];
            }
        }
    }
    map<int,int> match(const string &s,int now=0){
        auto &Nodes=this->Nodes;
        map<int,int> res;
        for (auto c:s){
            now=next(now,ctoi(c));
            for (auto &id:Nodes[now].idxs) ++res[id];
        }
        return res;
    }
    int move(const char &c,int now){
        while (next(now,ctoi(c))<0) now=next(now,FAIL);
        return next(now,ctoi(c));
    }
    pair<long long,int> move(const string &s,int now=0){
        long long res=0;
        for (auto &c:s){
            int nxt=move(c,now);
            res+=cnt[nxt]; now=nxt;
        }
        return {res,now};
    }
    int count(int node){return cnt[node];}
};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    string S; int M; cin >> S >> M;

    AhoCorasick<26> AHO([](char c){return c-'A';});
    for (;M--;){
        string C; cin >> C;
        AHO.add(C);
    }
    AHO.build();

    cout << AHO.move(S).first << '\n';
}
0