#943759 (C++17) No.2606 Mirror Relay

提出ソース

結果

問題	No.2606 Mirror Relay
ユーザー	👑 Nachia
提出日時	2024-01-12 23:23:59
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	9,782 bytes
コンパイル時間	1,755 ms
コンパイル使用メモリ	135,572 KB
実行使用メモリ	30,604 KB
最終ジャッジ日時	2024-09-28 00:09:17
合計ジャッジ時間	4,773 ms
ジャッジサーバーID （参考情報）	judge1 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,944 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	2 ms 6,944 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	2 ms 6,944 KB
testcase_08	AC	2 ms 6,944 KB
testcase_09	AC	2 ms 6,940 KB
testcase_10	AC	3 ms 6,940 KB
testcase_11	AC	2 ms 6,944 KB
testcase_12	AC	3 ms 6,944 KB
testcase_13	AC	2 ms 6,940 KB
testcase_14	AC	2 ms 6,940 KB
testcase_15	AC	2 ms 6,944 KB
testcase_16	AC	2 ms 6,940 KB
testcase_17	AC	2 ms 6,940 KB
testcase_18	AC	2 ms 6,944 KB
testcase_19	AC	3 ms 6,944 KB
testcase_20	AC	3 ms 6,944 KB
testcase_21	WA	-
testcase_22	WA	-
testcase_23	AC	3 ms 6,944 KB
testcase_24	AC	3 ms 6,944 KB
testcase_25	AC	3 ms 6,944 KB
testcase_26	AC	2 ms 6,940 KB
testcase_27	WA	-
testcase_28	AC	3 ms 6,940 KB
testcase_29	AC	2 ms 6,944 KB
testcase_30	AC	3 ms 6,940 KB
testcase_31	AC	3 ms 6,940 KB
testcase_32	AC	2 ms 6,944 KB
testcase_33	AC	3 ms 6,940 KB
testcase_34	AC	2 ms 6,944 KB
testcase_35	AC	2 ms 6,944 KB
testcase_36	AC	2 ms 6,944 KB
testcase_37	AC	2 ms 6,940 KB
testcase_38	AC	2 ms 6,944 KB
testcase_39	WA	-
testcase_40	WA	-
testcase_41	WA	-
testcase_42	WA	-
testcase_43	AC	23 ms 6,944 KB
testcase_44	AC	23 ms 6,944 KB
testcase_45	AC	23 ms 6,944 KB
testcase_46	WA	-
testcase_47	AC	23 ms 6,944 KB
testcase_48	AC	23 ms 6,944 KB
testcase_49	WA	-
testcase_50	WA	-
testcase_51	WA	-
testcase_52	WA	-
testcase_53	AC	33 ms 13,216 KB
testcase_54	WA	-
testcase_55	WA	-
testcase_56	WA	-
testcase_57	AC	29 ms 11,588 KB
testcase_58	WA	-
testcase_59	WA	-
testcase_60	WA	-
testcase_61	WA	-
testcase_62	WA	-
testcase_63	AC	18 ms 6,940 KB
testcase_64	WA	-
testcase_65	AC	18 ms 6,944 KB
testcase_66	WA	-
testcase_67	WA	-
testcase_68	AC	18 ms 6,944 KB
testcase_69	AC	53 ms 30,604 KB
testcase_70	AC	2 ms 5,376 KB
testcase_71	AC	2 ms 5,376 KB
testcase_72	AC	2 ms 5,376 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#ifdef NACHIA
// #define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <array>
#include <cmath>
#include <atcoder/modint>
using namespace std;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(i64 i=0; i<(i64)(n); i++)
#define repr(i,n) for(i64 i=(i64)(n)-1; i>=0; i--)
const i64 INF = 1001001001001001001;
const char* yn(bool x){ return x ? "Yes" : "No"; }
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
template<typename A> using nega_queue = priority_queue<A,vector<A>,greater<A>>;
using Modint = atcoder::static_modint<998244353>;

#include <iterator>
#include <functional>

template<class Elem> struct vec;

template<class Iter>
struct seq_view{
    using Ref = typename std::iterator_traits<Iter>::reference;
    using Elem = typename std::iterator_traits<Iter>::value_type;
    Iter a, b;
    Iter begin() const { return a; }
    Iter end() const { return b; }
    int size() const { return (int)(b-a); }
    seq_view(Iter first, Iter last) : a(first), b(last) {}
    seq_view sort() const { std::sort(a, b); return *this; }
    Ref& operator[](int x){ return *(a+x); }
    template<class F = std::less<Elem>, class ret = vec<int>> ret sorti(F f = F()) const {
        ret x(size()); for(int i=0; i<size(); i++) x[i] = i;
        x().sort([&](int l, int r){ return f(a[l],a[r]); });
        return x;
    }
    template<class ret = vec<Elem>> ret col() const { return ret(begin(), end()); }
    template<class F = std::equal_to<Elem>, class ret = vec<std::pair<Elem, int>>>
    ret rle(F eq = F()) const {
        auto x = ret();
        for(auto& a : (*this)){
            if(x.size() == 0 || !eq(x[x.size()-1].first, a)) x.emp(a, 1); else x[x.size()-1].second++;
        } return x;
    }
    template<class F> seq_view sort(F f) const { std::sort(a, b, f); return *this; }
    Iter uni() const { return std::unique(a, b); }
    Iter lb(const Elem& x) const { return std::lower_bound(a, b, x); }
    Iter ub(const Elem& x) const { return std::upper_bound(a, b, x); }
    int lbi(const Elem& x) const { return lb(x) - a; }
    int ubi(const Elem& x) const { return ub(x) - a; }
    seq_view bound(const Elem& l, const Elem& r) const { return { lb(l), lb(r) }; }
    template<class F> Iter lb(const Elem& x, F f) const { return std::lower_bound(a, b, x, f); }
    template<class F> Iter ub(const Elem& x, F f) const { return std::upper_bound(a, b, x, f); }
    template<class F> Iter when_true_to_false(F f) const {
        if(a == b) return a;
        return std::lower_bound(a, b, *a,
            [&](const Elem& x, const Elem&){ return f(x); });
    }
    seq_view same(Elem x) const { return { lb(x), ub(x) }; }
    template<class F> auto map(F f) const {
        vec<typename Iter::value_type> r;
        for(auto& x : *this) r.emp(f(x));
        return r;
    }
    Iter max() const { return std::max_element(a, b); }
    Iter min() const { return std::min_element(a, b); }
    template<class F = std::less<Elem>>
    Iter min(F f) const { return std::min_element(a, b, f); }
    seq_view rev() const { std::reverse(a, b); return *this; }
};

template<class Elem>
struct vec {
    using Base = typename std::vector<Elem>;
    using Iter = typename Base::iterator;
    using CIter = typename Base::const_iterator;
    using View = seq_view<Iter>;
    using CView = seq_view<CIter>;

    vec(){}
    explicit vec(int n, const Elem& value = Elem()) : a(0<n?n:0, value) {}
    template <class I2> vec(I2 first, I2 last) : a(first, last) {}
    vec(std::initializer_list<Elem> il) : a(std::move(il)) {}
    vec(Base b) : a(std::move(b)) {}
    operator Base() const { return a; }

    Iter begin(){ return a.begin(); }
    CIter begin() const { return a.begin(); }
    Iter end(){ return a.end(); }
    CIter end() const { return a.end(); }
    int size() const { return a.size(); }
    bool empty() const { return a.empty(); }
    Elem& back(){ return a.back(); }
    const Elem& back() const { return a.back(); }
    vec sortunied(){ vec x = *this; x().sort(); x.a.erase(x().uni(), x.end()); return x; }
    Iter operator()(int x){ return a.begin() + x; }
    CIter operator()(int x) const { return a.begin() + x; }
    View operator()(int l, int r){ return { (*this)(l), (*this)(r) }; }
    CView operator()(int l, int r) const { return { (*this)(l), (*this)(r) }; }
    View operator()(){ return (*this)(0,size()); }
    CView operator()() const { return (*this)(0,size()); }
    Elem& operator[](int x){ return a[x]; }
    const Elem& operator[](int x) const { return a[x]; }
    Base& operator*(){ return a; }
    const Base& operator*() const { return a; }
    vec& push(Elem args){
        a.push_back(std::move(args));
        return *this;
    }
    template<class... Args>
    vec& emp(Args &&... args){
        a.emplace_back(std::forward<Args>(args) ...);
        return *this;
    }
    template<class Range>
    vec& app(Range& x){ for(auto& v : a) emp(v); }
    Elem pop(){
        Elem x = std::move(a.back());
        a.pop_back(); return x;
    }
    bool operator==(const vec& r) const { return a == r.a; }
    bool operator!=(const vec& r) const { return a != r.a; }
    bool operator<(const vec& r) const { return a < r.a; }
    bool operator<=(const vec& r) const { return a <= r.a; }
    bool operator>(const vec& r) const { return a > r.a; }
    bool operator>=(const vec& r) const { return a >= r.a; }
    vec<vec<Elem>> pile(int n) const { return vec<vec<Elem>>(n, *this); }
    template<class F> vec& filter(F f){
        int p = 0;
        for(int q=0; q<size(); q++) if(f(a[q])) std::swap(a[p++],a[q]);
        a.resize(p); return *this;
    }
private: Base a;
};

template<class IStr, class U, class T>
IStr& operator>>(IStr& is, vec<std::pair<U,T>>& v){ for(auto& x:v){ is >> x.first >> x.second; } return is; }
template<class IStr, class T>
IStr& operator>>(IStr& is, vec<T>& v){ for(auto& x:v){ is >> x; } return is; }
template<class OStr, class T>
OStr& operator<<(OStr& os, const vec<T>& v){
    for(int i=0; i<v.size(); i++){
        if(i){ os << ' '; } os << v[i];
    } return os;
}
#include <map>

struct PalindromicTree {
    struct Node {
        int l;
        int r;
        int parent;
        int suffix;
        int prefix;
        int len() const { return r-l; }
    };
    vector<int> suffixLongest;
    vector<Node> nodes;
    vector<map<int,int>> children;
    vector<int> sbuffer;
    int currentLength;
    int numNodes() const { return nodes.size(); }
    int addSimpleChild(int parent, int c){
        if(children[parent].count(c)) return children[parent][c];
        int nx = numNodes();
        children[parent][c] = nx;
        nodes.push_back({ currentLength - 1, currentLength, parent, -1, -1 });
        children.emplace_back();
        return nx;
    }
    int add(int parent, int c, int duo){
        int nx = addSimpleChild(parent, c);
        if(nodes[nx].suffix >= 0) return nx;
        nodes[nx].r = currentLength;
        nodes[nx].l = currentLength - nodes[parent].len() - 2;
        int sufp = nodes[parent].suffix;
        while(!children[sufp].count(c)) sufp = nodes[sufp].suffix;
        if(sufp == 1 && duo == 0) sufp = 0;
        nodes[nx].suffix = (sufp < 0 ? 1 : children[sufp][c]);
        int prep = nodes[parent].prefix;
        while(!children[prep].count(c)) prep = nodes[prep].prefix;
        if(prep == 1 && duo == 0) prep = 0;
        nodes[nx].prefix = (prep < 0 ? 1 : children[prep][c]);
        return nx;
    }
    PalindromicTree(){
        nodes.push_back({ 0, -1, -1, -1, -1 });
        nodes.push_back({ 0, 0, -1, 0, 0 });
        suffixLongest.push_back(1);
        children.resize(2);
        currentLength = 0;
    }
    int addChar(int c){
        currentLength++;
        sbuffer.push_back(c);
        int one = addSimpleChild(0, c);
        nodes[one].suffix = 1;
        nodes[one].prefix = 1;
        int p = suffixLongest.back();
        while(p >= 0 && nodes[p].len() <= currentLength - 1 && sbuffer[currentLength - nodes[p].len() - 2] != c){
            p = nodes[p].suffix;
        }
        int duo = 0;
        if(currentLength >= 2 && sbuffer[currentLength - 2] == c) duo = 1;
        suffixLongest.push_back(add(p, c, duo));
        return suffixLongest.back();
    }
    Node operator[](int c){ return nodes[c]; }
    int longestWithNextChar(int x, int c){
        while(!children[x].count(c)){
            x = nodes[x].suffix;
        }
        return children[x][c];
    }
};

void testcase(){
    string S; cin >> S;
    reverse(S.begin(), S.end());
    PalindromicTree ptree;
    vec<int> pos;
    for(char c : S) pos.push(ptree.addChar(c));
    int N = ptree.numNodes();
    //cout << "S = " << S << endl;
    vec<i64> occ(N);
    rep(i,pos.size()) occ[pos[i]]++;
    repr(i,N) if(ptree[i].suffix >= 0) occ[ptree[i].suffix] += occ[i];
    if(false) rep(i,N){
        int l = ptree[i].l;
        int r = ptree[i].r;
        cout << "l = " << l << " , r = " << r << " , p = " << ptree[i].parent << " , s = " << ptree[i].suffix;
        cout << " , ";
        if(l < r) cout << "str = " << S.substr(l, r-l) << " , ";
         cout << "occ = " << occ[i];
        cout << endl;
    }
    rep(i,N) occ[i] *= max(0, ptree[i].len());
    rep(i,N) if(ptree[i].prefix >= 0) occ[i] += occ[ptree[i].prefix];
    //rep(i,S.size()) cout << occ[pos[i]] << " ";
    //cout << endl;
    i64 ans = occ().max().operator*();
    cout << ans << endl;
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    #ifdef NACHIA
    int T; cin >> T; for(int t=0; t<T; T!=++t?(cout<<'\n'),0:0)
    #endif
    testcase();
    return 0;
}

yukicoder

結果

テストケース

ソースコード