結果

問題 No.2204 Palindrome Splitting (No Rearrangement ver.)
ユーザー abc23abc23
提出日時 2023-02-10 20:49:20
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 632 ms / 2,000 ms
コード長 13,286 bytes
コンパイル時間 4,632 ms
コンパイル使用メモリ 270,068 KB
実行使用メモリ 199,612 KB
最終ジャッジ日時 2023-09-21 21:54:40
合計ジャッジ時間 13,460 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 147 ms
199,020 KB
testcase_01 AC 147 ms
198,844 KB
testcase_02 AC 146 ms
198,712 KB
testcase_03 AC 173 ms
199,288 KB
testcase_04 AC 154 ms
199,428 KB
testcase_05 AC 146 ms
198,720 KB
testcase_06 AC 148 ms
199,448 KB
testcase_07 AC 150 ms
199,348 KB
testcase_08 AC 150 ms
199,252 KB
testcase_09 AC 373 ms
199,612 KB
testcase_10 AC 157 ms
199,452 KB
testcase_11 AC 150 ms
199,568 KB
testcase_12 AC 156 ms
199,436 KB
testcase_13 AC 152 ms
199,528 KB
testcase_14 AC 155 ms
199,348 KB
testcase_15 AC 158 ms
199,524 KB
testcase_16 AC 149 ms
199,296 KB
testcase_17 AC 151 ms
199,392 KB
testcase_18 AC 156 ms
199,524 KB
testcase_19 AC 155 ms
199,444 KB
testcase_20 AC 154 ms
199,372 KB
testcase_21 AC 146 ms
199,308 KB
testcase_22 AC 147 ms
199,340 KB
testcase_23 AC 146 ms
199,380 KB
testcase_24 AC 414 ms
199,476 KB
testcase_25 AC 179 ms
199,444 KB
testcase_26 AC 206 ms
199,468 KB
testcase_27 AC 319 ms
199,352 KB
testcase_28 AC 154 ms
199,284 KB
testcase_29 AC 146 ms
199,428 KB
testcase_30 AC 148 ms
199,024 KB
testcase_31 AC 146 ms
198,936 KB
testcase_32 AC 147 ms
199,496 KB
testcase_33 AC 146 ms
199,580 KB
testcase_34 AC 148 ms
198,780 KB
testcase_35 AC 632 ms
199,452 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#if !__INCLUDE_LEVEL__

#include __FILE__

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 llx = (ull)lo() * x.lo();
        ull lu = (ull)hi() * x.lo() + (ull)lo() * x.hi();

        ull sum = uu + llx + ((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;
    }
};

//https://hitonanode.github.io/cplib-cpp/string/rolling_hash_1d.hpp
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 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;
    }
};

// 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();
    }
    V get(int l, int r) const { // s[l] * B^(r - l - 1) + ... + s[r - 1]
        return 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;
}

// using Hash = ModIntMersenne61;
using Hash = PairHash<ModIntMersenne61,ModIntMersenne61>;
using rol  = rolling_hash<Hash>;


const int maxs=5005;
V<V<int>> dp(maxs,V<int>(maxs,-1));
string str;

bool f(int l,int r,rol &rh,rol &rhrev){
  int lrev=sz(str)-r-1,rrev=sz(str)-l-1;
  return rh.get(l,r)==rhrev.get(lrev,rrev);
}
int dfs(int l,int r,rol &rh,rol &rhrev){
  if(dp[l][r]!=-1)return dp[l][r];
  if(f(l,r,rh,rhrev)){
    return (dp[l][r]=r-l+1);
  }
  int res=1;
  rep(i,l+1,r-1){
    if(!f(l,i,rh,rhrev))continue;
    chmax(res,min(i-l+1,dfs(i+1,r,rh,rhrev)));
  }
  return (dp[l][r]=res);
}
struct Solver {
void solve() {
  cin>>str;
  
  rol rh(str);
  reverse(all(str));
  rol rhrev(str);
  cout<<dfs(0,sz(str)-1,rh,rhrev)<<endl;
}};

signed main() {
  int ts = 1;
  // scanf("%lld",&ts);
  rep(ti,ts) {
    Solver solver;
    solver.solve();
  }
  return 0;
}

#else

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;

using namespace std;

#define int ll

using ll=long long;
using ld = long double;
using uint = unsigned;
using ull = unsigned long long;
using P=pair<int,int>;
using TP=tuple<int,int,int>;

const int INF = 1001001001;
const long long INFL = 3e18;
const int MAX = 2e6+5;

#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)
#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)
#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)
#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))
#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)
#define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c))
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define rrep(...) overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)
#define fore(i,a) for(auto &i:a)

#define all(x) x.begin(),x.end() 
#define allr(x) x.rbegin(),x.rend() 
#define sz(x) ((int)(x).size())
#define bp(x) (__builtin_popcountll((long long)(x)))
#define elif else if
#define mpa make_pair
#define bit(n) (1LL<<(n))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))

template<typename T> using V = vector<T>;
template<typename T> using max_heap = priority_queue<T>;
template<typename T> using min_heap = priority_queue<T, vector<T>, greater<>>;
template<typename T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}
template<typename T>ostream& operator<<(ostream&o,const vector<T>&v){if(sz(v))o<<join(v," ");return o;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.first<<","<<v.second;}
template<typename Tx, typename Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}
template<typename T>ll suma(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
template<typename T>ll suma(const V<V<T>>&a){ll res(0);for(auto&&x:a)res+=suma(x);return res;}
template<typename T>void uni(T& a){sort(all(a));a.erase(unique(all(a)),a.end());}
template<typename T>void prepend(vector<T>&a,const T&x){a.insert(a.begin(),x);}
template<typename T>T vgcd(T m, T n) {return std::gcd(m, n);}
template<typename T, typename... Args>T vgcd(T a, Args... args) {return vgcd(a, vgcd(args...));}

void print(){ putchar(' '); }
void print(bool a){ printf("%d", a); }
// void print(int a){ printf("%d", a); }
void print(unsigned a){ printf("%u", a); }
void print(long a){ printf("%ld", a); }
void print(long long a){ printf("%lld", a); }
void print(unsigned long long a){ printf("%llu", a); }
void print(char a){ printf("%c", a); }
void print(char *a){ printf("%s", a); }
void print(const char *a){ printf("%s", a); }
void print(double a){ printf("%.15f", a); }
void print(long double a){ printf("%.15Lf", a); }
void print(const string& a){ for(auto&& i : a) print(i); }
template<typename T> void print(const complex<T>& a){ if(a.real() >= 0) print('+'); print(a.real()); if(a.imag() >= 0) print('+'); print(a.imag()); print('i'); }
template<typename T> void print(const vector<T>&);
template<typename T, size_t size> void print(const array<T, size>&);
template<typename T, typename L> void print(const pair<T, L>& p);
template<typename T, size_t size> void print(const T (&)[size]);
template<typename T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }
template<typename T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }
template<typename T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }
template<typename T, typename L> void print(const pair<T, L>& p){ print(p.first); putchar(' '); print(p.second); }
template<typename T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ putchar(' '); print(*i); } }
template<typename T> void print(const T& a){ cout << a; }
int out(){ putchar('\n'); return 0; }
template<typename T> int out(const T& t){ print(t); putchar('\n'); return 0; }
template<typename Head, typename... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }


ll binary_search(function<bool(ll)> check, ll ok, ll ng) {
assert(check(ok));
  while (abs(ok - ng) > 1) {
    auto x = (ng + ok) / 2;
    if (check(x))
      ok = x;
    else
      ng = x;
  }
  return ok;
}

#endif
0