結果
| 問題 | No.599 回文かい |
| ユーザー |
 Coki628
|
| 提出日時 | 2021-01-21 12:52:11 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 116 ms / 4,000 ms |
| コード長 | 8,636 bytes |
| コンパイル時間 | 2,743 ms |
| コンパイル使用メモリ | 204,860 KB |
| 最終ジャッジ日時 | 2025-01-18 03:04:31 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 22 |
ソースコード
// #pragma GCC target("avx2")// #pragma GCC optimize("O3")// #pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>using namespace std;using ll = long long;using ld = long double;using pll = pair<ll, ll>;using pii = pair<int, int>;using vvl = vector<vector<ll>>;using vvi = vector<vector<int>>;using vvpll = vector<vector<pll>>;#define rep(i, a, b) for (ll i=(a); i<(b); i++)#define rrep(i, a, b) for (ll i=(a); i>(b); i--)#define pb push_back#define tostr to_string#define ALL(A) A.begin(), A.end()#define elif else if// constexpr ll INF = LONG_LONG_MAX;constexpr ll INF = 1e18;constexpr ll MOD = 1000000007;const string digits = "0123456789";const string ascii_lowercase = "abcdefghijklmnopqrstuvwxyz";const string ascii_uppercase = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";const string ascii_letters = ascii_lowercase + ascii_uppercase;template<typename T> vector<vector<T>> list2d(int N, int M, T init) { return vector<vector<T>>(N, vector<T>(M, init)); }template<typename T> vector<vector<vector<T>>> list3d(int N, int M, int L, T init) { return vector<vector<vector<T>>>(N, vector<vector<T>>(M, vector<T>(L, init))); }template<typename T> vector<vector<vector<vector<T>>>> list4d(int N, int M, int L, int O, T init) { return vector<vector<vector<vector<T>>>>(N,vector<vector<vector<T>>>(M, vector<vector<T>>(L, vector<T>(O, init)))); }vector<ll> LIST(ll N) { vector<ll> A(N); rep(i, 0, N) cin >> A[i]; return A; }void print(ld out) { cout << fixed << setprecision(15) << out << '\n'; }void print(double out) { cout << fixed << setprecision(15) << out << '\n'; }template<typename T> void print(T out) { cout << out << '\n'; }template<typename T1, typename T2> void print(pair<T1, T2> out) { cout << out.first << ' ' << out.second << '\n'; }template<typename T> void print(vector<T> A) { rep(i, 0, A.size()) { cout << A[i]; cout << (i == A.size()-1 ? '\n' : ' '); } }template<typename T> void print(set<T> S) { vector<T> A(S.begin(), S.end()); print(A); }void Yes() { print("Yes"); }void No() { print("No"); }void YES() { print("YES"); }void NO() { print("NO"); }ll floor(ll a, ll b) { if (a < 0) { return (a-b+1) / b; } else { return a / b; } }ll ceil(ll a, ll b) { if (a >= 0) { return (a+b-1) / b; } else { return a / b; } }pll divmod(ll a, ll b) { ll d = a / b; ll m = a % b; return {d, m}; }template<typename T> bool chmax(T &x, T y) { return (y > x) ? x = y, true : false; }template<typename T> bool chmin(T &x, T y) { return (y < x) ? x = y, true : false; }template<typename T> T sum(vector<T> A) { T res = 0; for (T a: A) res += a; return res; }template<typename T> T max(vector<T> A) { return *max_element(ALL(A)); }template<typename T> T min(vector<T> A) { return *min_element(ALL(A)); }ll toint(string s) { ll res = 0; for (char c : s) { res *= 10; res += (c - '0'); } return res; }int toint(char num) { return num - '0'; }char tochar(int num) { return '0' + num; }int ord(char c) { return (int)c; }char chr(int a) { return (char)a; }ll pow(ll x, ll n) { ll res = 1; rep(_, 0, n) res *= x; return res; }ll pow(ll x, ll n, int mod) { ll res = 1; while (n > 0) { if (n & 1) { res = (res * x) % mod; } x = (x * x) % mod; n >>= 1; } return res; }int popcount(ll S) { return __builtin_popcountll(S); }ll gcd(ll a, ll b) { return __gcd(a, b); }ll lcm(ll x, ll y) { return (x * y) / gcd(x, y); }template<typename T> int bisect_left(vector<T> &A, T val) { return lower_bound(ALL(A), val) - A.begin(); }template<typename T> int bisect_right(vector<T> &A, T val) { return upper_bound(ALL(A), val) - A.begin(); }template<int mod>struct ModInt {int x;ModInt() : x(0) {}ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}ModInt &operator+=(const ModInt &p) {if((x += p.x) >= mod) x -= mod;return *this;}ModInt &operator-=(const ModInt &p) {if((x += mod - p.x) >= mod) x -= mod;return *this;}ModInt &operator*=(const ModInt &p) {x = (int) (1LL * x * p.x % mod);return *this;}ModInt &operator/=(const ModInt &p) {*this *= p.inverse();return *this;}ModInt operator-() const { return ModInt(-x); }ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }bool operator==(const ModInt &p) const { return x == p.x; }bool operator!=(const ModInt &p) const { return x != p.x; }ModInt inverse() const {int a = x, b = mod, u = 1, v = 0, t;while(b > 0) {t = a / b;swap(a -= t * b, b);swap(u -= t * v, v);}return ModInt(u);}ModInt pow(int64_t n) const {ModInt ret(1), mul(x);while(n > 0) {if(n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}friend ostream &operator<<(ostream &os, const ModInt &p) {return os << p.x;}friend istream &operator>>(istream &is, ModInt &a) {int64_t t;is >> t;a = ModInt< mod >(t);return (is);}static int get_mod() { return mod; }};using mint = ModInt<MOD>;struct RollingHash {static const uint64_t mod = (1ull << 61ull) - 1;using uint128_t = __uint128_t;vector< uint64_t > power;const uint64_t base;static inline uint64_t add(uint64_t a, uint64_t b) {if((a += b) >= mod) a -= mod;return a;}static inline uint64_t mul(uint64_t a, uint64_t b) {uint128_t c = (uint128_t) a * b;return add(c >> 61, c & mod);}// 2^61-1以下の乱数を返す。これをbaseとするとHackされにくいstatic inline uint64_t generate_base() {mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());uniform_int_distribution< uint64_t > rand(1, RollingHash::mod - 1);return rand(mt);}inline void expand(size_t sz) {if(power.size() < sz + 1) {int pre_sz = (int) power.size();power.resize(sz + 1);for(int i = pre_sz - 1; i < sz; i++) {power[i + 1] = mul(power[i], base);}}}// 基数baseのローリングハッシュを構築するexplicit RollingHash(uint64_t base = generate_base()) : base(base), power{1} {}// 文字列sのハッシュテーブルを返す：O(n)vector< uint64_t > build(const string &s) const {int sz = s.size();vector< uint64_t > hashed(sz + 1);for(int i = 0; i < sz; i++) {hashed[i + 1] = add(mul(hashed[i], base), s[i]);}return hashed;}template< typename T >vector< uint64_t > build(const vector< T > &s) const {int sz = s.size();vector< uint64_t > hashed(sz + 1);for(int i = 0; i < sz; i++) {hashed[i + 1] = add(mul(hashed[i], base), s[i]);}return hashed;}// sの区間[l,r)のハッシュ値を返す：O(1)uint64_t query(const vector< uint64_t > &s, int l, int r) {expand(r - l);return add(s[r], mod - mul(s[l], power[r - l]));}// ハッシュ値h1と長さh2lenのハッシュ値h2を結合するuint64_t combine(uint64_t h1, uint64_t h2, size_t h2len) {expand(h2len);return add(mul(h1, power[h2len]), h2);}// ハッシュテーブルaの区間[l1,r1)と、ハッシュテーブルbの区間[l2,r2)の文字列の最長共通接頭辞の長さを返す：O(logn)int lcp(const vector< uint64_t > &a, int l1, int r1, const vector< uint64_t > &b, int l2, int r2) {int len = min(r1 - l1, r2 - l2);int low = 0, high = len + 1;while(high - low > 1) {int mid = (low + high) / 2;if(query(a, l1, l1 + mid) == query(b, l2, l2 + mid)) low = mid;else high = mid;}return low;}};int main() {cin.tie(0);ios::sync_with_stdio(false);string S;cin >> S;ll N = S.size();RollingHash rh;auto s_table = rh.build(S);vector<mint> dp(N+1);dp[0] = 1;rep(r, 1, N/2+1) {rep(l, 0, r) {if (rh.query(s_table, l, r) == rh.query(s_table, N-r, N-l)) {dp[r] += dp[l];}}}mint ans = 0;rep(i, 0, N/2+1) ans += dp[i];print(ans);return 0;}