#726063 (C++17(clang)) No.599 回文かい

• 問題: No.599 回文かい
• ユーザー: illanasty
• 提出日時: 2021-12-23 21:49:07
• 言語: C++17(clang) (17.0.6 + boost 1.87.0)
• 結果: AC
• 実行時間: 388 ms / 4,000 ms
• コード長: 1,894 bytes
• コンパイル時間: 1,549 ms
• コンパイル使用メモリ: 143,584 KB
• 実行使用メモリ: 199,360 KB
• 最終ジャッジ日時: 2024-09-17 20:39:43
• 合計ジャッジ時間: 4,323 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

ファイルパターン	結果
other	AC * 22

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ull = unsigned long long;
using ll = long long;
using ld = long double;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep2(i, n, m) for (ll i = n; i <= m; ++i)
#define rep3(i, n, m) for (ll i = n; i >= m; --i)
template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
template<class T> using pq  = priority_queue<T>;
template<class S, class T> inline bool chmax(S &a, T b) { if (a < b) { a = b; return true; } return false; }
template<class S, class T> inline bool chmin(S &a, T b) { if (a > b) { a = b; return true; } return false; }
constexpr int MOD = 1000000007;
string s;
int n;
int memo[10005];
vector<vector<int>> Z;
vector<int> ZAlgorithm(string S) {
  int N = S.size();
  vector<int> Z(N, 0);
  Z[0] = N;
  int i = 1, j = 0;
  while (i < N) {
    while (i + j < N && S[i+j] == S[j]) ++j;
    Z[i] = j;
    if (j == 0) {
      ++i;
      continue;
    }
    int k = 1;
    while (k < j && k + Z[k] < j) {
      Z[i+k] = Z[k];
      ++k;
    }
    i += k;
    j -= k;
  }
  return Z;
}
int dp(int l, int r) {
  if (r - l <= 1) return 1LL;
  if (memo[l] != -1) return memo[l];
  int& ret = memo[l];
  ret = 1;
  for (int l2 = l+1, r2 = r-1; l2 <= r2; ++l2, --r2) {
    if (Z[l][r2 - l] >= l2 - l) {
      ret += dp(l2, r2);
      ret %= MOD;
    }
  }
  return ret;
}
int main() {
  cin >> s;
  n = s.size();
  memset(memo, -1, sizeof(memo));
  rep(i, n) {
    Z.push_back(ZAlgorithm(s.substr(i, n-i)));
  }
  cout << dp(0, n) << endl;
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX