結果

問題 No.263 Common Palindromes Extra
ユーザー kuhakukuhaku
提出日時 2023-09-21 15:37:10
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 6,624 bytes
コンパイル時間 4,615 ms
コンパイル使用メモリ 280,136 KB
実行使用メモリ 62,620 KB
最終ジャッジ日時 2023-09-21 15:37:16
合計ジャッジ時間 6,185 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 5 ms
4,376 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 8 ms
4,376 KB
testcase_04 AC 30 ms
5,468 KB
testcase_05 AC 51 ms
5,672 KB
testcase_06 AC 4 ms
4,380 KB
testcase_07 AC 62 ms
33,204 KB
testcase_08 AC 76 ms
33,104 KB
testcase_09 WA -
testcase_10 AC 88 ms
61,220 KB
testcase_11 AC 24 ms
5,180 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "a.cpp"
#define PROBLEM ""
#line 2 "/home/kuhaku/atcoder/github/algo/lib/template/template.hpp"
#pragma GCC target("sse4.2,avx2,bmi2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
template <class T, class U>
bool chmax(T &a, const U &b) {
    return a < (T)b ? a = (T)b, true : false;
}
template <class T, class U>
bool chmin(T &a, const U &b) {
    return (T)b < a ? a = (T)b, true : false;
}
constexpr std::int64_t INF = 1000000000000000003;
constexpr int Inf = 1000000003;
constexpr int MOD = 1000000007;
constexpr int MOD_N = 998244353;
constexpr double EPS = 1e-7;
constexpr double PI = M_PI;
#line 3 "/home/kuhaku/atcoder/github/algo/lib/template/macro.hpp"
#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)
#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)
#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)
#define rep(i, n) FOR (i, 0, n)
#define repn(i, n) FOR (i, 1, n + 1)
#define repr(i, n) FORR (i, n, 0)
#define repnr(i, n) FORR (i, n + 1, 1)
#define all(s) (s).begin(), (s).end()
#line 3 "/home/kuhaku/atcoder/github/algo/lib/template/sonic.hpp"
struct Sonic {
    Sonic() {
        std::ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
    }

    constexpr void operator()() const {}
} sonic;
#line 5 "/home/kuhaku/atcoder/github/algo/lib/template/atcoder.hpp"
using namespace std;
using ll = std::int64_t;
using ld = long double;
template <class T, class U>
std::istream &operator>>(std::istream &is, std::pair<T, U> &p) {
    return is >> p.first >> p.second;
}
template <class T>
std::istream &operator>>(std::istream &is, std::vector<T> &v) {
    for (T &i : v) is >> i;
    return is;
}
template <class T, class U>
std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {
    return os << '(' << p.first << ',' << p.second << ')';
}
template <class T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {
    for (auto it = v.begin(); it != v.end(); ++it) {
        os << (it == v.begin() ? "" : " ") << *it;
    }
    return os;
}
template <class Head, class... Tail>
void co(Head &&head, Tail &&...tail) {
    if constexpr (sizeof...(tail) == 0) std::cout << head << '\n';
    else std::cout << head << ' ', co(std::forward<Tail>(tail)...);
}
template <class Head, class... Tail>
void ce(Head &&head, Tail &&...tail) {
    if constexpr (sizeof...(tail) == 0) std::cerr << head << '\n';
    else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);
}
template <typename T, typename... Args>
auto make_vector(T x, int arg, Args... args) {
    if constexpr (sizeof...(args) == 0) return std::vector<T>(arg, x);
    else return std::vector(arg, make_vector<T>(x, args...));
}
void setp(int n) {
    std::cout << std::fixed << std::setprecision(n);
}
void Yes(bool is_correct = true) {
    std::cout << (is_correct ? "Yes" : "No") << '\n';
}
void No(bool is_not_correct = true) {
    Yes(!is_not_correct);
}
void YES(bool is_correct = true) {
    std::cout << (is_correct ? "YES" : "NO") << '\n';
}
void NO(bool is_not_correct = true) {
    YES(!is_not_correct);
}
void Takahashi(bool is_correct = true) {
    std::cout << (is_correct ? "Takahashi" : "Aoki") << '\n';
}
void Aoki(bool is_not_correct = true) {
    Takahashi(!is_not_correct);
}
#line 3 "a.cpp"

struct palindromic_tree {
  private:
    struct _node {
        using pointer = _node *;

        std::map<char, int> link;
        int suffix_link;
        int len;
        int count;

        _node() : link(), suffix_link(), len(), count() {}
        _node(int _suffix_link, int _len, int _count)
            : link(), suffix_link(_suffix_link), len(_len), count(_count) {}
    };

  public:
    using node_type = _node;
    using node_pointer = typename _node::pointer;

    palindromic_tree() : c(), s(), active_idx() {
        create_node(0, -1, 0);
        create_node(0, 0, 0);
    }

    int size() const {
        return c.size();
    }

    int get_active_idx() const {
        return active_idx;
    }

    node_pointer get_node(int id) {
        return &c[id];
    }

    int add(char ch) {
        s.push_back(ch);
        int a = find_prev_palindrome_idx(active_idx);
        auto inserted_result = c[a].link.insert(std::make_pair(ch, int(c.size())));
        active_idx = inserted_result.first->second;
        if (!inserted_result.second) {
            c[active_idx].count++;
            return active_idx;
        }

        node_pointer node = create_node(0, c[a].len + 2, 1);
        if (node->len == 1) {
            node->suffix_link = 1;
        } else {
            int b = find_prev_palindrome_idx(c[a].suffix_link);
            node->suffix_link = c[b].link[ch];
        }
        return active_idx;
    }

    int move(char ch) {
        s.push_back(ch);
        while (true) {
            active_idx = find_prev_palindrome_idx(active_idx);
            auto it = c[active_idx].link.find(ch);
            if (it != c[active_idx].link.end()) {
                active_idx = it->second;
                return active_idx;
            }
            if (active_idx == 0)
                break;
            active_idx = c[active_idx].suffix_link;
        }
        return active_idx;
    }

    std::vector<int> build_frequency() {
        std::vector<int> res(c.size());
        for (int i = int(c.size()) - 1; i > 0; --i) {
            res[i] += c[i].count;
            res[c[i].suffix_link] += res[i];
        }
        return res;
    }

    void clear() {
        s = string();
        active_idx = 0;
    }

  private:
    std::vector<node_type> c;
    string s;
    int active_idx;

    node_pointer create_node(int suffix_link, int len, int count) {
        c.emplace_back(suffix_link, len, count);
        return &c.back();
    }

    int find_prev_palindrome_idx(int node_id) {
        int pos = int(s.size()) - 1;
        while (true) {
            int opposite_side_idx = pos - 1 - c[node_id].len;
            if (opposite_side_idx >= 0 && s[opposite_side_idx] == s.back())
                break;
            node_id = c[node_id].suffix_link;
        }
        return node_id;
    }
};

int main(void) {
    string s, t;
    cin >> s >> t;
    palindromic_tree pt;
    for (auto c : s) pt.add(c);
    auto vs = pt.build_frequency();
    int m = vs.size();
    rep (i, m) {
        if (i < 2)
            continue;
        int p = pt.get_node(i)->suffix_link;
        if (p >= 2)
            vs[i] += vs[p];
    }
    pt.clear();
    ll ans = 0;
    for (auto c : t) {
        int idx = pt.move(c);
        if (idx >= 2)
            ans += vs[idx];
    }
    co(ans);

    return 0;
}
0