#291490 (C++14) No.430 文字列検索

• 問題: No.430 文字列検索
• ユーザー: MitI_7
• 提出日時: 2018-10-12 21:34:04
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 48 ms / 2,000 ms
• コード長: 4,201 bytes
• コンパイル時間: 2,286 ms
• コンパイル使用メモリ: 188,012 KB
• 実行使用メモリ: 16,896 KB
• 最終ジャッジ日時: 2024-04-20 19:54:36
• 合計ジャッジ時間: 3,227 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	48 ms; 16,896 KB
testcase_02	AC	20 ms; 8,448 KB
testcase_03	AC	12 ms; 6,400 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	4 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	2 ms; 5,376 KB
testcase_11	AC	19 ms; 8,192 KB
testcase_12	AC	19 ms; 8,064 KB
testcase_13	AC	18 ms; 8,192 KB
testcase_14	AC	16 ms; 7,040 KB
testcase_15	AC	14 ms; 7,040 KB
testcase_16	AC	18 ms; 8,704 KB
testcase_17	AC	20 ms; 9,216 KB

ソースコード

#include <bits/stdc++.h>

#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x)  cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());

typedef long long LL;
template<typename T> using V = std::vector<T>;
template<typename T> using VV = std::vector<std::vector<T>>;
template<typename T> using VVV = std::vector<std::vector<std::vector<T>>>;

template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
template<class T> inline void print(T x) { std::cout << x << std::endl; }
template<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) {  if (i != 0) {std::cout << " ";} std::cout << v[i];} std::cout << "\n"; }
template<class T> inline bool inside(T y, T x, T H, T W) {return 0 <= y and y < H and 0 <= x and x < W; }
template<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }
template<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }

const int INF = 1L << 30;
const double EPS = 1e-9;
const std::string YES = "YES", Yes = "Yes", NO = "NO", No = "No";
const std::vector<int> dy4 = { 0, 1, 0, -1 }, dx4 = { 1, 0, -1, 0 };    // 4近傍（右, 下, 左, 上）
const std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };

using namespace std;

struct Node {
    unordered_map<int, Node*> next;
    Node* failure;
    vector<string> output;

    Node() {
        failure = nullptr;
    };

    void insert(int i, const string &s) {
        if (i >= s.size()) {
            output.emplace_back(s);
            return;
        }

        if (this->next[s[i]] == nullptr) {
            this->next[s[i]] = new Node();
        }

        this->next[s[i]]->insert(i + 1, s);
    }
};

class AhoCorasick {
public:
    Node root;

    void insert(string word) {
        root.insert(0, word);
    }

    void build() {
        queue<Node*> que;
        que.push(&root);
        while (not que.empty()) {
            auto node = que.front(); que.pop();

            for (auto p : node->next) {
                auto now = node;
                auto next = p.second;
                if (next == nullptr) {
                    continue;
                }
                que.push(next);

                while (now != &root and now->failure->next[p.first] == nullptr) {
                    now = now->failure;
                }

                if (now == &root) {
                    next->failure = &root;
                    continue;
                }

                next->failure = now->failure->next[p.first];
                for (auto s : next->failure->output) {
                    next->output.emplace_back(s);
                }
            }
        }
    }

    set<pair<int, string>> find(const string &text) {
        set<pair<int, string>> ans;
        auto now = &root;
        for (int i = 0; i < text.size(); ++i) {
            while (now != &root and now->next[text[i]] == nullptr) {
                now = now->failure;
            }

            // root
            if (now->next[text[i]] == nullptr) {
                assert(now == &root);
                continue;
            }

            now = now->next[text[i]];

            for (int j = 0; j < now->output.size(); ++j) {
                ans.insert(make_pair(i - now->output[j].size() + 1, now->output[j]));
            }
        }
        return ans;
    }

};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    string S;
    cin >> S;
    int M;
    cin >> M;
    
    AhoCorasick ac;
    FOR(i, 0, M) {
        string C;
        cin >> C;
        ac.insert(C);
    }
    ac.build();

    print(ac.find(S).size());

    return 0;
}