#656117 (C++17) No.273 回文分解

• 問題: No.273 回文分解
• ユーザー: maine_honzuki
• 提出日時: 2021-05-11 10:50:35
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 2 ms / 2,000 ms
• コード長: 2,275 bytes
• コンパイル時間: 2,268 ms
• コンパイル使用メモリ: 207,612 KB
• 最終ジャッジ日時: 2025-01-21 10:01:50
• ジャッジサーバーID （参考情報）: judge5 / judge4

ファイルパターン	結果
sample	AC * 3
other	AC * 32

ソースコード

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
//https://ncode.syosetu.com/n4830bu/001/
#include <bits/stdc++.h>
using namespace std;
struct PalindromicTree {
    PalindromicTree() {
        node* size_m1 = create_node();
        size_m1->suffix_link = 0;
        size_m1->len = -1;
        node* size_0 = create_node();
        size_0->suffix_link = 0;
        size_0->len = 0;
        active_idx = 0;
    }
    struct node {
        map<char, int> link;
        int suffix_link, len, count;
    };
    vector<node> nodes;
    string S;
    int active_idx;
    node* create_node() {
        nodes.emplace_back();
        node* ret = &nodes.back();
        ret->count = 0;
        return ret;
    }
    int find_prev_palindromic_idx(int node_id) {
        const int pos = (int)S.size() - 1;
        while (true) {
            const int opposite_side_idx = pos - 1 - nodes[node_id].len;
            if (opposite_side_idx >= 0 && S[opposite_side_idx] == S.back()) break;
            node_id = nodes[node_id].suffix_link;
        }
        return node_id;
    }
    void add(char ch) {
        S += ch;
        const int prev = find_prev_palindromic_idx(active_idx);
        const auto inserted_result = nodes[prev].link.insert(make_pair(ch, (int)nodes.size()));
        active_idx = inserted_result.first->second;
        if (!inserted_result.second) {
            nodes[active_idx].count++;
            return;
        }
        node* new_node = create_node();
        new_node->count = 1;
        new_node->len = nodes[prev].len + 2;
        if (new_node->len == 1) {
            new_node->suffix_link = 1;
        } else {
            new_node->suffix_link = nodes[find_prev_palindromic_idx(nodes[prev].suffix_link)].link[ch];
        }
    }
    vector<int> build_frequency() {
        vector<int> frequency(nodes.size());
        for (int i = (int)nodes.size() - 1; i > 0; i--) {
            frequency[i] += nodes[i].count;
            frequency[nodes[i].suffix_link] += frequency[i];
        }
        return frequency;
    }
};
int main() {
    string S;
    cin >> S;
    PalindromicTree eertree;
    for (auto&& c : S) {
        eertree.add(c);
    }
    int ans = 0;
    for (auto&& node : eertree.nodes) {
        if (node.len != S.size())
            ans = max(ans, node.len);
    }
    cout << ans << endl;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX