#1012640 (C++17) No.430 文字列検索

• 問題: No.430 文字列検索
• ユーザー: pop_o
• 提出日時: 2024-09-21 13:11:10
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 44 ms / 2,000 ms
• コード長: 2,523 bytes
• コンパイル時間: 2,124 ms
• コンパイル使用メモリ: 202,024 KB
• 最終ジャッジ日時: 2025-02-24 11:14:09
• ジャッジサーバーID （参考情報）: judge2 / judge1

ファイルパターン	結果
sample	AC * 4
other	AC * 14

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
#include<bits/stdc++.h>
using namespace std;
// https://atcoder.jp/contests/abc362/submissions/57921480
// https://atcoder.jp/contests/practice2/submissions/57923167
// return suffix array (size: n+1) beginning with the empty string
template<typename T>
vector<int> suffix_array(const T &s) {
    int t = 1, n = (int) s.size();
    vector<int> tmp(n+1), rank(n+1), sa(n+1);
    auto comp = [&] (int i, int j) -> bool {
        if (rank[i] != rank[j]) {
            return rank[i] < rank[j];
        } else {
            return (i + t <= n ? rank[i + t]: -1) < (j + t <= n ? rank[j + t]: -1);
        }
    };
    for (int i = 0; i <= n; i++) {
        sa[i] = i;
        rank[i] = i < n ? s[i]: -1;
    }
    for (; t <= n; t <<= 1) {
        sort(sa.begin(), sa.end(), comp);
        tmp[sa[0]] = 0;
        for (int i = 1; i <= n; i++) {
            tmp[sa[i]] = tmp[sa[i-1]] + (comp(sa[i-1], sa[i]) ? 1: 0);
        }
        for (int i = 0; i <= n; i++) {
            rank[i] = tmp[i];
        }
    }
    return sa;
}
template<typename T>
vector<int> lcp_array(const T &s, const vector<int> &sa) {
    int n = (int) s.size(), h = 0;
    vector<int> rank(n+1), lcp(n+1, 0);
    for (int i = 0; i <= n; i++) {
        rank[sa[i]] = i;
    }
    for (int i = 0; i < n; i++) {
        int j = sa[rank[i]-1];
        if (h > 0) h--;
        for (;j+h < n && i+h < n; h++) {
           if (s[j+h] != s[i+h]) break;
        }
        lcp[rank[i]-1] = h;
    }
    return lcp;
}
// return the number of t
template<typename T, typename S = char>
int count_string(T &t, const T &s, const vector<int> &sa) {
    int n = (int)s.size();
    int ok1 = -1, ng1 = n+1, ok2 = -1, ng2 = n+1;
    while (ng1 - ok1 > 1) {
        int mid = (ok1 + ng1) / 2;
        int m = min((int)t.size(), n - sa[mid]);
        if (s.substr(sa[mid], m) < t) {
            ok1 = mid;
        } else {
            ng1 = mid;
        }
    }
    t.push_back('~');
    while (ng2 - ok2 > 1) {
        int mid = (ok2 + ng2) / 2;
        int m = min((int)t.size(), n - sa[mid]);
        if (s.substr(sa[mid], m) < t) {
            ok2 = mid;
        } else {
            ng2 = mid;
        }
    }
    t.pop_back();
    return ok2 - ok1;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    string s;
    cin >> s;
    vector<int> sa = suffix_array(s);
    int m;
    cin >> m;
    long long ans = 0;
    for (;m--;) {
        string c;
        cin >> c;
        ans += count_string(c, s, sa);
    }
    cout << ans << "\n";
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX