結果
| 問題 | No.599 回文かい |
| ユーザー |
 arktan763
|
| 提出日時 | 2019-09-19 01:22:02 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 154 ms / 4,000 ms |
| コード長 | 6,940 bytes |
| コンパイル時間 | 1,662 ms |
| コンパイル使用メモリ | 171,312 KB |
| 実行使用メモリ | 6,944 KB |
| 最終ジャッジ日時 | 2024-07-18 01:44:23 |
| 合計ジャッジ時間 | 3,032 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 22 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define int long long// #define double long double#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)#define FORR(i, a, b) for(ll i = (a); i > (b); --i)#define REP(i, n) for(ll i = 0; i < (n); ++i)#define REPR(i, n) for(ll i = n; i >= 0; i--)#define FOREACH(x, a) for(auto &(x) : (a))#define VECCIN(x) \for(auto &youso_ : (x)) cin >> youso_#define bitcnt(x) __builtin_popcount(x)#define lbit(x) __builtin_ffsll(x)#define rbit(x) __builtin_clzll(x)#define SZ(x) ((ll)(x).size())#define fi first#define se second#define All(a) (a).begin(), (a).end()#define rAll(a) (a).rbegin(), (a).rend()template <typename T = long long> inline T IN() {T x;cin >> x;return (x);}inline void CIN() {}template <class Head, class... Tail>inline void CIN(Head &&head, Tail &&... tail) {cin >> head;CIN(move(tail)...);}#define CCIN(...) \char __VA_ARGS__; \CIN(__VA_ARGS__)#define DCIN(...) \double __VA_ARGS__; \CIN(__VA_ARGS__)#define LCIN(...) \ll __VA_ARGS__; \CIN(__VA_ARGS__)#define SCIN(...) \string __VA_ARGS__; \CIN(__VA_ARGS__)#define Yes(a) cout << (a ? "Yes" : "No") << "\n"#define YES(a) cout << (a ? "YES" : "NO") << "\n"#define Printv(v) \{ \FOREACH(x, v) { cout << x << " "; } \cout << "\n"; \}template <typename T = string> inline void eputs(T s) {cout << s << "\n";exit(0);}template <typename A, size_t N, typename T>void Fill(A (&array)[N], const T &val) {std::fill((T *)array, (T *)(array + N), val);}template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;template <typename T> using PQ = priority_queue<T>;typedef long long ll;typedef vector<ll> VL;typedef vector<VL> VVL;typedef pair<ll, ll> PL;typedef vector<PL> VPL;typedef vector<bool> VB;typedef vector<double> VD;typedef vector<string> VS;const int INF = 1e9;const int MOD = 1e9 + 7;// const int MOD = 998244353;const ll LINF = 5e18;// const double PI = atan(1.0) * 4.0;const ll dx[] = {1, 1, 0, -1, -1, -1, 0, 1};const ll dy[] = {0, 1, 1, 1, 0, -1, -1, -1};#define PI 3.141592653589793238// 1000000007 で割ったあまりを扱う構造体template <int MOD> struct Fp {long long val;constexpr Fp(long long v = 0) noexcept : val(v % MOD) {if(val < 0) v += MOD;}constexpr int getmod() { return MOD; }constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }constexpr Fp operator+(const Fp &r) const noexcept {return Fp(*this) += r;}constexpr Fp operator-(const Fp &r) const noexcept {return Fp(*this) -= r;}constexpr Fp operator*(const Fp &r) const noexcept {return Fp(*this) *= r;}constexpr Fp operator/(const Fp &r) const noexcept {return Fp(*this) /= r;}constexpr Fp &operator+=(const Fp &r) noexcept {val += r.val;if(val >= MOD) val -= MOD;return *this;}constexpr Fp &operator-=(const Fp &r) noexcept {val -= r.val;if(val < 0) val += MOD;return *this;}constexpr Fp &operator*=(const Fp &r) noexcept {val = val * r.val % MOD;return *this;}constexpr Fp &operator/=(const Fp &r) noexcept {long long a = r.val, b = MOD, u = 1, v = 0;while(b) {long long t = a / b;a -= t * b;swap(a, b);u -= t * v;swap(u, v);}val = val * u % MOD;if(val < 0) val += MOD;return *this;}constexpr bool operator==(const Fp &r) const noexcept {return this->val == r.val;}constexpr bool operator!=(const Fp &r) const noexcept {return this->val != r.val;}friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {return os << x.val;}friend constexpr istream &operator>>(istream &is, Fp<MOD> &x) noexcept {return is >> x.val;}friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {if(n == 0) return 1;auto t = modpow(a, n / 2);t = t * t;if(n & 1) t = t * a;return t;}};using mint = Fp<MOD>;// ローリングハッシュ// 二分探索で LCP を求める機能つきstruct RollingHash {static const int base1 = 1007, base2 = 2009;static const int mod1 = 1000000007, mod2 = 1000000009;vector<long long> hash1, hash2, power1, power2;// constructRollingHash(const string &S) {int n = (int)S.size();hash1.assign(n + 1, 0);hash2.assign(n + 1, 0);power1.assign(n + 1, 1);power2.assign(n + 1, 1);for(int i = 0; i < n; ++i) {hash1[i + 1] = (hash1[i] * base1 + S[i]) % mod1;hash2[i + 1] = (hash2[i] * base2 + S[i]) % mod2;power1[i + 1] = (power1[i] * base1) % mod1;power2[i + 1] = (power2[i] * base2) % mod2;}}// get hash of S[left:right]inline pair<long long, long long> get(int l, int r) const {long long res1 = hash1[r] - hash1[l] * power1[r - l] % mod1;if(res1 < 0) res1 += mod1;long long res2 = hash2[r] - hash2[l] * power2[r - l] % mod2;if(res2 < 0) res2 += mod2;return {res1, res2};}// get lcp of S[a:] and T[b:]inline int getLCP(int a, int b) const {int len = min((int)hash1.size() - a, (int)hash1.size() - b);int low = 0, high = len;while(high - low > 1) {int mid = (low + high) >> 1;if(get(a, a + mid) != get(b, b + mid))high = mid;elselow = mid;}return low;}};mint dp[10010];bool used[10010];signed main() {SCIN(S);ll N = S.length();RollingHash rh(S);mint ans = 1;used[0] = true;dp[0] = 1;FOR(i, 1, N / 2 + 1) {REP(j, i) if(used[j]) {if(rh.get(j, i) == rh.get(N - i, N - j)) dp[i] += dp[j];}ans += dp[i];used[i] = true;}cout << ans << "\n";}