結果
| 問題 | No.2606 Mirror Relay |
| ユーザー |
👑  hitonanode
|
| 提出日時 | 2024-01-12 22:30:14 |
| 言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 650 ms / 2,000 ms |
| コード長 | 19,571 bytes |
| コンパイル時間 | 4,718 ms |
| コンパイル使用メモリ | 230,484 KB |
| 実行使用メモリ | 57,756 KB |
| 最終ジャッジ日時 | 2024-01-12 22:30:40 |
| 合計ジャッジ時間 | 9,359 ms |
|
ジャッジサーバーID （参考情報） |
judge15 / judge11 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
6,676 KB |
| testcase_01 | AC | 2 ms
6,676 KB |
| testcase_02 | AC | 2 ms
6,676 KB |
| testcase_03 | AC | 2 ms
6,676 KB |
| testcase_04 | AC | 3 ms
6,676 KB |
| testcase_05 | AC | 2 ms
6,676 KB |
| testcase_06 | AC | 3 ms
6,676 KB |
| testcase_07 | AC | 3 ms
6,676 KB |
| testcase_08 | AC | 3 ms
6,676 KB |
| testcase_09 | AC | 3 ms
6,676 KB |
| testcase_10 | AC | 2 ms
6,676 KB |
| testcase_11 | AC | 2 ms
6,676 KB |
| testcase_12 | AC | 3 ms
6,676 KB |
| testcase_13 | AC | 3 ms
6,676 KB |
| testcase_14 | AC | 2 ms
6,676 KB |
| testcase_15 | AC | 2 ms
6,676 KB |
| testcase_16 | AC | 2 ms
6,676 KB |
| testcase_17 | AC | 2 ms
6,676 KB |
| testcase_18 | AC | 2 ms
6,676 KB |
| testcase_19 | AC | 4 ms
6,676 KB |
| testcase_20 | AC | 4 ms
6,676 KB |
| testcase_21 | AC | 3 ms
6,676 KB |
| testcase_22 | AC | 4 ms
6,676 KB |
| testcase_23 | AC | 4 ms
6,676 KB |
| testcase_24 | AC | 4 ms
6,676 KB |
| testcase_25 | AC | 3 ms
6,676 KB |
| testcase_26 | AC | 4 ms
6,676 KB |
| testcase_27 | AC | 4 ms
6,676 KB |
| testcase_28 | AC | 3 ms
6,676 KB |
| testcase_29 | AC | 3 ms
6,676 KB |
| testcase_30 | AC | 2 ms
6,676 KB |
| testcase_31 | AC | 3 ms
6,676 KB |
| testcase_32 | AC | 3 ms
6,676 KB |
| testcase_33 | AC | 2 ms
6,676 KB |
| testcase_34 | AC | 2 ms
6,676 KB |
| testcase_35 | AC | 2 ms
6,676 KB |
| testcase_36 | AC | 3 ms
6,676 KB |
| testcase_37 | AC | 3 ms
6,676 KB |
| testcase_38 | AC | 3 ms
6,676 KB |
| testcase_39 | AC | 40 ms
19,864 KB |
| testcase_40 | AC | 41 ms
19,864 KB |
| testcase_41 | AC | 39 ms
19,864 KB |
| testcase_42 | AC | 39 ms
19,864 KB |
| testcase_43 | AC | 39 ms
19,864 KB |
| testcase_44 | AC | 38 ms
19,864 KB |
| testcase_45 | AC | 39 ms
19,864 KB |
| testcase_46 | AC | 40 ms
19,864 KB |
| testcase_47 | AC | 40 ms
19,864 KB |
| testcase_48 | AC | 39 ms
19,864 KB |
| testcase_49 | AC | 151 ms
28,996 KB |
| testcase_50 | AC | 165 ms
29,980 KB |
| testcase_51 | AC | 167 ms
30,532 KB |
| testcase_52 | AC | 150 ms
27,060 KB |
| testcase_53 | AC | 182 ms
30,664 KB |
| testcase_54 | AC | 157 ms
29,524 KB |
| testcase_55 | AC | 262 ms
38,488 KB |
| testcase_56 | AC | 152 ms
29,512 KB |
| testcase_57 | AC | 162 ms
27,704 KB |
| testcase_58 | AC | 187 ms
32,248 KB |
| testcase_59 | AC | 61 ms
19,864 KB |
| testcase_60 | AC | 61 ms
19,864 KB |
| testcase_61 | AC | 52 ms
19,864 KB |
| testcase_62 | AC | 57 ms
19,864 KB |
| testcase_63 | AC | 64 ms
19,864 KB |
| testcase_64 | AC | 56 ms
19,864 KB |
| testcase_65 | AC | 61 ms
19,864 KB |
| testcase_66 | AC | 55 ms
19,864 KB |
| testcase_67 | AC | 59 ms
19,864 KB |
| testcase_68 | AC | 59 ms
19,864 KB |
| testcase_69 | AC | 650 ms
57,756 KB |
| testcase_70 | AC | 2 ms
6,676 KB |
| testcase_71 | AC | 2 ms
6,676 KB |
| testcase_72 | AC | 2 ms
6,676 KB |
ソースコード
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif
#include <atcoder/segtree>
int op(int l, int r) { return min(l, r); }
int e() { return 1 << 29; }
// Manacher's Algorithm: radius of palindromes
// Input: std::string or std::vector<T> of length N
// Output: std::vector<int> of size N
// Complexity: O(N)
// Sample:
// - `sakanakanandaka` -> [1, 1, 2, 1, 4, 1, 4, 1, 2, 2, 1, 1, 1, 2, 1]
// Reference: https://snuke.hatenablog.com/entry/2014/12/02/235837
template <typename T> std::vector<int> manacher(const std::vector<T> &S) {
std::vector<int> res(S.size());
int i = 0, j = 0;
while (i < int(S.size())) {
while (i - j >= 0 and i + j < int(S.size()) and S[i - j] == S[i + j]) j++;
res[i] = j;
int k = 1;
while (i - k >= 0 and i + k < int(S.size()) and k + res[i - k] < j)
res[i + k] = res[i - k], k++;
i += k, j -= k;
}
return res;
}
std::vector<int> manacher(const std::string &S) {
std::vector<char> v(S.size());
for (int i = 0; i < int(S.size()); i++) v[i] = S[i];
return manacher(v);
}
template <typename T>
std::vector<std::pair<int, int>> enumerate_palindromes(const std::vector<T> &vec) {
std::vector<T> v;
const int N = vec.size();
for (int i = 0; i < N - 1; i++) {
v.push_back(vec[i]);
v.push_back(-1);
}
v.push_back(vec.back());
const auto man = manacher(v);
std::vector<std::pair<int, int>> ret;
for (int i = 0; i < N * 2 - 1; i++) {
if (i & 1) {
int w = man[i] / 2;
ret.emplace_back((i + 1) / 2 - w, (i + 1) / 2 + w);
} else {
int w = (man[i] - 1) / 2;
ret.emplace_back(i / 2 - w, i / 2 + w + 1);
}
}
return ret;
}
std::vector<std::pair<int, int>> enumerate_palindromes(const std::string &S) {
std::vector<char> v(S.size());
for (int i = 0; i < int(S.size()); i++) v[i] = S[i];
return enumerate_palindromes<char>(v);
}
// F_p, p = 2^61 - 1
// https://qiita.com/keymoon/items/11fac5627672a6d6a9f6
class ModIntMersenne61 {
static const long long md = (1LL << 61) - 1;
long long _v;
inline unsigned hi() const noexcept { return _v >> 31; }
inline unsigned lo() const noexcept { return _v & ((1LL << 31) - 1); }
public:
static long long mod() { return md; }
ModIntMersenne61() : _v(0) {}
// 0 <= x < md * 2
explicit ModIntMersenne61(long long x) : _v(x >= md ? x - md : x) {}
long long val() const noexcept { return _v; }
ModIntMersenne61 operator+(const ModIntMersenne61 &x) const {
return ModIntMersenne61(_v + x._v);
}
ModIntMersenne61 operator-(const ModIntMersenne61 &x) const {
return ModIntMersenne61(_v + md - x._v);
}
ModIntMersenne61 operator*(const ModIntMersenne61 &x) const {
using ull = unsigned long long;
ull uu = (ull)hi() * x.hi() * 2;
ull ll = (ull)lo() * x.lo();
ull lu = (ull)hi() * x.lo() + (ull)lo() * x.hi();
ull sum = uu + ll + ((lu & ((1ULL << 30) - 1)) << 31) + (lu >> 30);
ull reduced = (sum >> 61) + (sum & ull(md));
return ModIntMersenne61(reduced);
}
ModIntMersenne61 pow(long long n) const {
assert(n >= 0);
ModIntMersenne61 ans(1), tmp = *this;
while (n) {
if (n & 1) ans *= tmp;
tmp *= tmp, n >>= 1;
}
return ans;
}
ModIntMersenne61 inv() const { return pow(md - 2); }
ModIntMersenne61 operator/(const ModIntMersenne61 &x) const { return *this * x.inv(); }
ModIntMersenne61 operator-() const { return ModIntMersenne61(md - _v); }
ModIntMersenne61 &operator+=(const ModIntMersenne61 &x) { return *this = *this + x; }
ModIntMersenne61 &operator-=(const ModIntMersenne61 &x) { return *this = *this - x; }
ModIntMersenne61 &operator*=(const ModIntMersenne61 &x) { return *this = *this * x; }
ModIntMersenne61 &operator/=(const ModIntMersenne61 &x) { return *this = *this / x; }
ModIntMersenne61 operator+(unsigned x) const { return ModIntMersenne61(this->_v + x); }
bool operator==(const ModIntMersenne61 &x) const { return _v == x._v; }
bool operator!=(const ModIntMersenne61 &x) const { return _v != x._v; }
bool operator<(const ModIntMersenne61 &x) const { return _v < x._v; } // To use std::map
template <class OStream> friend OStream &operator<<(OStream &os, const ModIntMersenne61 &x) {
return os << x._v;
}
static ModIntMersenne61 randgen(bool force_update = false) {
static ModIntMersenne61 b(0);
if (b == ModIntMersenne61(0) or force_update) {
std::mt19937 mt(std::chrono::steady_clock::now().time_since_epoch().count());
std::uniform_int_distribution<long long> d(1, ModIntMersenne61::mod());
b = ModIntMersenne61(d(mt));
}
return b;
}
};
#include <algorithm>
#include <chrono>
#include <random>
#include <string>
#include <tuple>
#include <vector>
template <class T1, class T2> struct PairHash : public std::pair<T1, T2> {
using PH = PairHash<T1, T2>;
explicit PairHash(T1 x, T2 y) : std::pair<T1, T2>(x, y) {}
explicit PairHash(int x) : std::pair<T1, T2>(x, x) {}
PairHash() : PairHash(0) {}
PH operator+(const PH &x) const { return PH(this->first + x.first, this->second + x.second); }
PH operator-(const PH &x) const { return PH(this->first - x.first, this->second - x.second); }
PH operator*(const PH &x) const { return PH(this->first * x.first, this->second * x.second); }
PH operator+(int x) const { return PH(this->first + x, this->second + x); }
static PH randgen(bool force_update = false) {
static PH b(0);
if (b == PH(0) or force_update) {
std::mt19937 mt(std::chrono::steady_clock::now().time_since_epoch().count());
std::uniform_int_distribution<int> d(1 << 30);
b = PH(T1(d(mt)), T2(d(mt)));
}
return b;
}
template <class OStream> friend OStream &operator<<(OStream &os, const PH &x) {
return os << "(" << x.first << ", " << x.second << ")";
}
};
template <class T1, class T2, class T3> struct TupleHash3 : public std::tuple<T1, T2, T3> {
using TH = TupleHash3<T1, T2, T3>;
explicit TupleHash3(T1 x, T2 y, T3 z) : std::tuple<T1, T2, T3>(x, y, z) {}
explicit TupleHash3(int x) : std::tuple<T1, T2, T3>(x, x, x) {}
TupleHash3() : TupleHash3(0) {}
inline const T1 &v1() const noexcept { return std::get<0>(*this); }
inline const T2 &v2() const noexcept { return std::get<1>(*this); }
inline const T3 &v3() const noexcept { return std::get<2>(*this); }
TH operator+(const TH &x) const { return TH(v1() + x.v1(), v2() + x.v2(), v3() + x.v3()); }
TH operator-(const TH &x) const { return TH(v1() - x.v1(), v2() - x.v2(), v3() - x.v3()); }
TH operator*(const TH &x) const { return TH(v1() * x.v1(), v2() * x.v2(), v3() * x.v3()); }
TH operator+(int x) const { return TH(v1() + x, v2() + x, v3() + x); }
static TH randgen(bool force_update = false) {
static TH b(0);
if (b == TH(0) or force_update) {
std::mt19937 mt(std::chrono::steady_clock::now().time_since_epoch().count());
std::uniform_int_distribution<int> d(1 << 30);
b = TH(T1(d(mt)), T2(d(mt)), T3(d(mt)));
}
return b;
}
template <class OStream> friend OStream &operator<<(OStream &os, const TH &x) {
return os << "(" << x.v1() << ", " << x.v2() << ", " << x.v3() << ")";
}
};
// Rolling Hash (Rabin-Karp), 1dim
template <typename V> struct rolling_hash {
int N;
const V B;
std::vector<V> hash; // hash[i] = s[0] * B^(i - 1) + ... + s[i - 1]
static std::vector<V> power; // power[i] = B^i
void _extend_powvec() {
if (power.size() > 1 and power.at(1) != B) power = {V(1)};
while (static_cast<int>(power.size()) <= N) {
auto tmp = power.back() * B;
power.push_back(tmp);
}
}
template <typename Int>
rolling_hash(const std::vector<Int> &s, V b = V::randgen()) : N(s.size()), B(b), hash(N + 1) {
for (int i = 0; i < N; i++) hash[i + 1] = hash[i] * B + s[i];
_extend_powvec();
}
rolling_hash(const std::string &s = "", V b = V::randgen()) : N(s.size()), B(b), hash(N + 1) {
for (int i = 0; i < N; i++) hash[i + 1] = hash[i] * B + s[i];
_extend_powvec();
}
void addchar(const char &c) {
V hnew = hash[N] * B + c;
N++, hash.emplace_back(hnew);
_extend_powvec();
}
struct Hash {
int length;
V val;
Hash() : length(0), val(V()) {}
Hash(int len, const V &v) : length(len), val(v) {}
bool operator==(const Hash &r) const noexcept {
return length == r.length and val == r.val;
}
Hash operator*(const Hash &r) const {
return Hash(length + r.length, val * power.at(r.length) + r.val);
}
template <class OStream> friend OStream &operator<<(OStream &os, const Hash &x) {
return os << "(length=" << x.length << ", val=" << x.val << ")";
}
};
Hash get(int l, int r) const { // s[l] * B^(r - l - 1) + ... + s[r - 1]
if (l >= r) return Hash();
return Hash(r - l, hash[r] - hash[l] * power[r - l]);
}
int lcplen(int l1, int l2) const { return longest_common_prefix(*this, l1, *this, l2); }
};
template <typename V> std::vector<V> rolling_hash<V>::power{V(1)};
// Longest common prerfix between s1[l1, N1) and s2[l2, N2)
template <typename T>
int longest_common_prefix(const rolling_hash<T> &rh1, int l1, const rolling_hash<T> &rh2, int l2) {
int lo = 0, hi = std::min(rh1.N + 1 - l1, rh2.N + 1 - l2);
while (hi - lo > 1) {
const int c = (lo + hi) / 2;
auto h1 = rh1.get(l1, l1 + c), h2 = rh2.get(l2, l2 + c);
(h1 == h2 ? lo : hi) = c;
}
return lo;
}
// Longest common suffix between s1[0, r1) and s2[0, r2)
template <typename T>
int longest_common_suffix(const rolling_hash<T> &rh1, int r1, const rolling_hash<T> &rh2, int r2) {
int lo = 0, hi = std::min(r1, r2) + 1;
while (hi - lo > 1) {
const int c = (lo + hi) / 2;
auto h1 = rh1.get(r1 - c, r1), h2 = rh2.get(r2 - c, r2);
(h1 == h2 ? lo : hi) = c;
}
return lo;
}
struct Trie {
char a_init;
int D;
int INVALID = -1;
std::vector<std::vector<int>> child;
std::vector<int> par;
using T_NODE = lint;
std::vector<T_NODE> v_info;
Trie(char a_init = 'a', int D = 26)
: a_init(a_init), D(D), child(1, std::vector<int>(D, INVALID)), par(1, -1), v_info(1) {}
int step(int now, char c) const {
if (now == INVALID) return INVALID;
return child.at(now).at(c - a_init);
}
int add_word(const std::string &str, T_NODE info) {
int now = 0;
for (auto &c : str) {
if (child[now][c - a_init] == INVALID) {
par.push_back(now);
child[now][c - a_init] = child.size();
child.emplace_back(D, INVALID);
v_info.resize(child.size());
}
now = child[now][c - a_init];
}
v_info[now] += info;
return now;
}
};
int main() {
string S;
cin >> S;
dbg(S);
rolling_hash<ModIntMersenne61> rh(S);
auto par = enumerate_palindromes(S);
dbg(par);
using P = pair<int, ModIntMersenne61>;
map<P, pint> mp;
map<P, lint> mpw;
map<P, lint> mpw_done;
vector<int> init(S.size() * 2 - 1, e());
vector<pint> initmemo(S.size() * 2 - 1);
for (auto [l, r] : par) {
if (l == r) continue;
auto h = rh.get(l, r);
mp[{r - l, h.val}] = {l, r};
mpw[{r - l, h.val}]++;
if (chmin(init.at(l + r - 1), l)) {
initmemo.at(l + r - 1) = {l, r};
}
}
atcoder::segtree<int, op, e> seg(init);
vector<pint> lrs;
while (!mpw.empty()) {
auto [key, v] = *prev(mpw.end());
mpw.erase(key);
mpw_done[key] = v;
auto [l, r] = mp.at(key);
lrs.emplace_back(l, r);
++l;
--r;
if (l < r) {
mp[{r - l, rh.get(l, r).val}] = {l, r};
mpw[{r - l, rh.get(l, r).val}] += v;
}
}
reverse(ALL(lrs));
dbg(lrs);
// Trie trie('a', 26);
map<ModIntMersenne61, lint> dp;
lint ret = 0;
for (auto [l, r] : lrs) {
dbg(make_tuple(r - l, l, r));
lint s0 = mpw_done.at({r - l, rh.get(l, r).val}) * (r - l);
int c = seg.min_left(r + l - 1, [&](int x) { return x > l; }) - 1;
if (c >= 0) {
auto [ll, rr] = initmemo.at(c);
int w = l - ll;
ll += w;
rr -= w;
dbg(make_tuple(l, r, ll, rr));
if (ll < rr) s0 += dp.at(rh.get(ll, rr).val);
}
dp[rh.get(l, r).val] = s0;
chmax(ret, s0);
}
cout << ret << '\n';
}