#836973 (C++17) No.2204 Palindrome Splitting (No Rearrangement ver.)

提出ソース

結果

問題	No.2204 Palindrome Splitting (No Rearrangement ver.)
ユーザー	siganai
提出日時	2023-02-03 21:38:20
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	376 ms / 2,000 ms
コード長	11,570 bytes
コンパイル時間	2,506 ms
コンパイル使用メモリ	210,632 KB
実行使用メモリ	4,384 KB
最終ジャッジ日時	2023-09-15 17:17:14
合計ジャッジ時間	13,142 ms
ジャッジサーバーID （参考情報）	judge12 / judge13

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 4,380 KB
testcase_01	AC	2 ms 4,376 KB
testcase_02	AC	2 ms 4,380 KB
testcase_03	AC	218 ms 4,380 KB
testcase_04	AC	51 ms 4,380 KB
testcase_05	AC	29 ms 4,380 KB
testcase_06	AC	372 ms 4,380 KB
testcase_07	AC	331 ms 4,380 KB
testcase_08	AC	302 ms 4,380 KB
testcase_09	AC	316 ms 4,376 KB
testcase_10	AC	372 ms 4,380 KB
testcase_11	AC	300 ms 4,380 KB
testcase_12	AC	366 ms 4,380 KB
testcase_13	AC	374 ms 4,380 KB
testcase_14	AC	370 ms 4,380 KB
testcase_15	AC	343 ms 4,376 KB
testcase_16	AC	143 ms 4,384 KB
testcase_17	AC	187 ms 4,380 KB
testcase_18	AC	373 ms 4,380 KB
testcase_19	AC	371 ms 4,380 KB
testcase_20	AC	371 ms 4,376 KB
testcase_21	AC	373 ms 4,380 KB
testcase_22	AC	371 ms 4,384 KB
testcase_23	AC	370 ms 4,384 KB
testcase_24	AC	375 ms 4,376 KB
testcase_25	AC	371 ms 4,380 KB
testcase_26	AC	375 ms 4,380 KB
testcase_27	AC	244 ms 4,376 KB
testcase_28	AC	376 ms 4,376 KB
testcase_29	AC	373 ms 4,376 KB
testcase_30	AC	2 ms 4,376 KB
testcase_31	AC	2 ms 4,380 KB
testcase_32	AC	260 ms 4,380 KB
testcase_33	AC	372 ms 4,380 KB
testcase_34	AC	1 ms 4,380 KB
testcase_35	AC	260 ms 4,380 KB

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

ソースコード

raw source code

#line 1 "test.cpp"
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.hpp>
#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (static_cast<void>(0))
#endif
using ll = long long;
using ld = long double;
using pll = pair<ll,ll>;
using pii = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vs = vector<string>;
template<class T> using pq = priority_queue<T,vector<T>,greater<T>>;
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(a,b,c,name,...) name
#define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER)
#define rep2(i, n) for (ll i = 0; i < (n); ++i)
#define rep3(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--)
#define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--)
#define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all1(i) begin(i),end(i)
#define all2(i,a) begin(i),begin(i)+a
#define all3(i,a,b) begin(i)+a,begin(i)+b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__),0LL)
template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; }
template<class T> auto min(const T& a){ return *min_element(all(a)); }
template<class T> auto max(const T& a){ return *max_element(all(a)); }
template<class... Ts> void in(Ts&... t);
#define INT(...) int __VA_ARGS__; in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__; in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; in(__VA_ARGS__)
#define VEC(type, name, size) vector<type> name(size); in(name)
#define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name)
ll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;}
ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll GCD(ll a,ll b) { if(a == 0 || b == 0) return a + b; if(a % b == 0) return b; else return GCD(b,a%b);}
ll LCM(ll a,ll b) { if(a == 0) return b; if(b == 0) return a;return a / GCD(a,b) * b;}
namespace IO{
#define VOID(a) decltype(void(a))
struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting;
template<int I> struct P : P<I-1>{};
template<> struct P<0>{};
template<class T> void i(T& t){ i(t, P<3>{}); }
void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; }
template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; }
template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); }
template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){
    in(get<idx>(t)...);}
template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){
    ituple(t, make_index_sequence<tuple_size<T>::value>{});}
#undef VOID
}
#define unpack(a) (void)initializer_list<int>{(a, 0)...}
template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); }
#undef unpack
static const double PI = 3.1415926535897932;
template <class F> struct REC {
    F f;
    REC(F &&f_) : f(forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }};
//constexpr int mod = 1000000007;
constexpr int mod = 998244353;

#line 2 "library/inner/inner-hash.hpp"
namespace inner {
    using i64 = long long;
    using u64 = unsigned long long;
    using u128 = __uint128_t;
    template <int BASE_NUM = 2>
    struct Hash: array<u64, BASE_NUM> {
        using array<u64, BASE_NUM>::operator[];
        static constexpr int n = BASE_NUM;

        Hash():array<u64, BASE_NUM>() {}

        static constexpr u64 md = (1ull << 61) - 1;

        constexpr static Hash set(const i64 &a) {
            Hash res;
            fill(begin(res),end(res),cast(a));
            return res;
        }

        Hash &operator +=(const Hash &r) {
            for(int i = 0;i < n; i++) {
                if(((*this)[i] += r[i]) >= md) (*this[i]) -= md;
            }
            return *this;
        }
        Hash &operator+=(const i64 &r) {
            u64 s = cast(r);
            for (int i = 0; i < n; i++) {
                if (((*this)[i] += s) >= md) (*this)[i] -= md;
            }
            return *this;
        }
        Hash &operator-=(const Hash &r) {
            for (int i = 0; i < n; i++) {
                if (((*this)[i] += md - r[i]) >= md) (*this)[i] -= md;
            }
            return *this;
        }
        Hash &operator-=(const i64 &r) {
            u64 s = cast(r);
            for (int i = 0; i < n; i++) {
                if (((*this)[i] += md - s) >= md) (*this)[i] -= md;
            }
            return *this;
        }
        Hash &operator*=(const Hash &r) {
            for (int i = 0; i < n; i++) {
                (*this)[i] = modmul((*this)[i], r[i]);
            }
            return *this;
        }
        Hash &operator*=(const i64 &r) {
            u64 s = cast(r);
            for (int i = 0; i < n; i++) {
                (*this)[i] = modmul((*this)[i], s);
            }
        return *this;
        }

        Hash operator+(const Hash &r) { return Hash(*this) += r; }
        Hash operator+(const i64 &r) { return Hash(*this) += r; }
        Hash operator-(const Hash &r) { return Hash(*this) -= r; }
        Hash operator-(const i64 &r) { return Hash(*this) -= r; }
        Hash operator*(const Hash &r) { return Hash(*this) *= r; }
        Hash operator*(const i64 &r) { return Hash(*this) *= r; }
        Hash operator-() const {
            Hash res;
            for (int i = 0; i < n; i++) {
                res[i] = (*this)[i] == 0 ? 0 : md - (*this)[i];
            }
            return res;
        }
        friend Hash pfma(const Hash &a, const Hash &b, const Hash &c) {
            Hash res;
            for (int i = 0; i < n; i++) {
                res[i] = modfma(a[i], b[i], c[i]);
            }
            return res;
        }
        friend Hash pfma(const Hash &a, const Hash &b, const i64 &c) {
            Hash res;
            u64 s = cast(c);
            for (int i = 0; i < n; i++) {
                res[i] = modfma(a[i], b[i], s);
            }
            return res;
        }

        static Hash get_basis() {
            static auto rand_time =
            chrono::duration_cast<chrono::nanoseconds>(
            chrono::high_resolution_clock::now().time_since_epoch())
            .count();
            static mt19937_64 rng(rand_time);
            Hash h;
            for (int i = 0; i < n; i++) {
                while (isPrimitive(h[i] = rng() % (md - 1) + 1) == false);
            }
            return h;
        }

    private:
        static u64 modpow(u64 a, u64 b) {
            u64 r = 1;
            for (a %= md; b; a = modmul(a, a), b >>= 1) r = modmul(r, a);
            return r;
        }
        static bool isPrimitive(u64 x) {
            for (auto &d : vector<u64>{2, 3, 5, 7, 11, 13, 31, 41, 61, 151, 331, 1321})
            if (modpow(x, (md - 1) / d) <= 1) return false;
            return true;
        }
        static inline constexpr u64 cast(const long long &a) {
            return a < 0 ? a + md : a;
        }
        static inline constexpr u64 modmul(const u64 &a, const u64 &b) {
            u128 ret = u128(a) * b;
            ret = (ret & md) + (ret >> 61);
            return ret >= md ? ret - md : ret;
        }
        static inline constexpr u64 modfma(const u64 &a, const u64 &b, const u64 &c) {
            u128 ret = u128(a) * b + c;
            ret = (ret & md) + (ret >> 61);
            return ret >= md ? ret - md : ret;
        }
    };
}
#line 3 "library/string/Rolling-Hash.hpp"
template <typename Str, int BASE_NUM = 2>
struct RollingHash {
    using Hash = inner::Hash<BASE_NUM>;
    Str data;
    vector<Hash> hs,pw;
    int s;
    static Hash basis;

    RollingHash(const Str &S = Str()) {build(S);}
    void build(const Str &S) {
        data = S;
        s = S.size();
        hs.resize(s + 1);
        pw.resize(s + 1);
        pw[0] = Hash::set(1);
        hs[0] = Hash::set(0);
        for(int i = 1;i <= s; i++) {
            pw[i] = pw[i-1] * basis;
            hs[i] = pfma(hs[i-1],basis,S[i-1]);
        }
    }

    Hash get(int l,int r = -1) const{
        if(r == -1)r = s;
        return pfma(hs[l],-pw[r-l],hs[r]);
    }

    static Hash get_hash(const Str &T) {
        Hash ret = Hash::set(0);
        for(int i = 0;i < (int)T.size();i++) {
            ret = pfma(ret,basis,T[i]);
        }
        return ret;
    }
    int find(Str &T, int lower = 0) const {
        auto ths = get_Hash(T);
        for(int i = lower; i <= s -(int)T.size();i++) {
            if(ths == get(i,i + (int)T.size())) return i;
        }  
        return -1;
    }
    friend int LCP(const RollingHash &a,RollingHash &b,int astart,int bstart) {
        int ok = 0,ng = min(a.size() - astart,b.size() - bstart) + 1;
        while (ok + 1 < ng) {
            int med = (ok + ng) / 2;
            (a.get(astart,med + astart) == b.get(bstart,med + bstart) ? ok:ng) = med;
        }
        return ok;
    }
    friend int strcmp(const RollingHash &a,RollingHash &b,int astart,int bstart,int aend = -1,int bend = -1) {
        if (aend == -1) aend = a.size();
        if (bend == -1) bend = b.size();
        if (aend - astart == bend - bstart) {
            if(a.get(astart,aend) == b.get(bstart,bend)) {
                return 0;
            }
        }
        else if(aend - astart < bend - bstart) {
            if(a.get(astart,aend) == b.get(bstart,bstart + aend - astart)) {
                return 1;
            }            
        }
        else {
            if(a.get(astart,astart + bend - bstart) == b.get(bstart,bend)) {
                return -1;
            }               
        }
        if (a.data[astart] < b.data[bstart]) {return 1;}
        else if (a.data[astart] > b.data[bstart]) {return -1;}
        int n = min<int>({LCP(a,b,astart,bstart),aend - astart,bend - bstart});
        return astart + n == aend ? bstart + n == bend ? 0 : 1
            : bstart + n == bend                    ? -1
            : a.data[astart + n] < b.data[bstart + n] ? 1
                                                : -1;
    }
    int size() const{return s;}
};
template <typename Str,int BASE_NUM>
typename RollingHash<Str,BASE_NUM>::Hash RollingHash<Str,BASE_NUM>::basis = inner::Hash<BASE_NUM>::get_basis();
#line 87 "test.cpp"
using roriha = RollingHash<string,2>;
int main() {
    STR(s);
    int n = s.size();
    string t = s;
    reverse(all(t));
    roriha rs(s),rt(t);
    vi dp(n+1);
    rep(i,1,n+1) dp[0] = n;
    rep(i,1,n+1) {
        rep(j,i) {
            if(rs.get(j,i) == rt.get(n-i,n-j)) chmax(dp[i],min(dp[j],int(i-j)));
        }
    }
    cout << dp[n] << '\n';
}

yukicoder

結果

テストケース

ソースコード