#511952 (C++17) No.464 PPAP

提出ソース

結果

問題	No.464 PPAP
ユーザー	haruki_K
提出日時	2020-07-15 19:20:40
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	323 ms / 2,000 ms
コード長	6,932 bytes
コンパイル時間	2,080 ms
コンパイル使用メモリ	212,028 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-05-01 23:41:30
合計ジャッジ時間	4,836 ms
ジャッジサーバーID （参考情報）	judge5 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,816 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	2 ms 6,944 KB
testcase_03	AC	1 ms 6,940 KB
testcase_04	AC	2 ms 6,944 KB
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	15 ms 6,940 KB
testcase_08	AC	11 ms 6,940 KB
testcase_09	AC	10 ms 6,940 KB
testcase_10	AC	323 ms 6,940 KB
testcase_11	AC	174 ms 6,944 KB
testcase_12	AC	270 ms 6,944 KB
testcase_13	AC	220 ms 6,944 KB
testcase_14	AC	209 ms 6,944 KB
testcase_15	AC	2 ms 6,940 KB
testcase_16	AC	1 ms 6,944 KB
testcase_17	AC	2 ms 6,940 KB
testcase_18	AC	1 ms 6,940 KB
testcase_19	AC	2 ms 6,940 KB
testcase_20	AC	1 ms 6,940 KB
testcase_21	AC	1 ms 6,940 KB
testcase_22	AC	2 ms 6,944 KB
testcase_23	AC	222 ms 6,940 KB
testcase_24	AC	220 ms 6,940 KB
testcase_25	AC	219 ms 6,940 KB

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

ソースコード

raw source code

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
template <class Int> auto constexpr inf = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf<int32_t>;
auto constexpr INF64 = inf<int64_t>;
auto constexpr INF   = inf<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
const int dx[] = { 1,0,-1,0 };
const int dy[] = { 0,1,0,-1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
template <class Int> struct Random {
    mt19937_64 mt{random_device{}()};
    //mt19937_64 mt{(unsigned)time(0)};
    Int a,b; // [a,b]
    Random(Int a, Int b) : a(a), b(b) {}
    Int operator()() { return uniform_int_distribution<Int>(a,b)(mt); }
};
template <class Int> Int rand(Int a, Int b) { // [a,b]
    static mt19937_64 mt{random_device{}()};
    return uniform_int_distribution<Int>(a,b)(mt);
}
// <<<
// >>> rolling hash
template <class Str>
struct RollingHash {
    using u64 = uint64_t;
    using u32 = uint32_t;
    static constexpr u64 mod = (1ull<<61) - 1;
    static u64 base;
    static void init_base() {
        if (base) return;
        mt19937_64 mt(random_device{}());
        base = uniform_int_distribution<u64>(300,mod-300)(mt);
    }

    static constexpr u64 mul(u64 a, u64 b) {
        constexpr u64 mask30 = (1ull << 30) - 1;
        constexpr u64 mask31 = (1ull << 31) - 1;
        u64 au = a >> 31;
        u64 ad = a & mask31;
        u64 bu = b >> 31;
        u64 bd = b & mask31;
        u64 mid = ad * bu + au * bd;
        u64 midu = mid >> 30;
        u64 midd = mid & mask30;
        u64 val = au * bu * 2 + midu + (midd << 31) + ad * bd;
        return (val & mod) + (val >> 61);
    }
    static constexpr u64 take_mod(u64 val) {
        val = (val & mod) + (val >> 61);
        if (val >= mod) val -= mod;
        return val;
    }
    static constexpr u32 xorshift(u32 x) {
        x ^= x << 13; x ^= x >> 17; x ^= x << 5;
        return x;
    }

    Str s;
    vector<u64> hash;
    static vector<u64> pow;

    RollingHash(Str const& s = "") : s(s) {
        init_base();
        hash.resize(s.size()+1);
        rep (i,s.size()) {
            hash[i+1] = take_mod(mul(hash[i],base) + (xorshift(s[i]^u32(base))));
        }
        if (pow.size() < s.size()+1) {
            auto m = max(signed(pow.size())-1, 0);
            pow.resize(s.size()+1,1);
            for (int i = m; i+1 < (int)pow.size(); ++i) {
                pow[i+1] = take_mod(mul(pow[i],base));
            }
        }
    }
    u64 get() const { return hash.back(); }
    u64 get(int l, int r) const {
        return take_mod(3*mod - mul(hash[l],pow[r-l]) + hash[r]);
    }
};

template <class Str> uint64_t RollingHash<Str>::base;
template <class Str> vector<uint64_t> RollingHash<Str>::pow;
using u64 = uint64_t;
// <<<

int32_t main() {
    string s; cin >> s;
    const int n = s.size();

    auto t = s;
    reverse(all(t));
    RollingHash<string> rs(s),rt(t);
    auto is_palid = [&](int l, int r) {
        int a = n-1-(r-1), b = n-1-l+1;
        return rs.get(l,r) == rt.get(a,b);
    };

    vector<int> dp(n+1);
    dp[0] = 1;

    auto P = [&]() {
        vector<int> ndp(n+1);
        rep (i,n+1) rep (j,n+1) if (dp[i] > 0 && i < j && is_palid(i,j)) {
            ndp[j] += dp[i];
        }
        swap(dp,ndp);
    };
    auto A = [&]() {
        vector<int> ndp(n+1);
        rep (i,n+1) rep (j,n+1) if (dp[i] > 0 && i < j) {
            ndp[j] += dp[i];
        }
        swap(dp,ndp);
    };
    P();
    P();
    A();
    P();

    cout << dp[n] << endl;

}

yukicoder

結果

テストケース

ソースコード