結果
問題 | No.599 回文かい |
ユーザー | Pachicobue |
提出日時 | 2017-11-25 00:18:48 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,366 bytes |
コンパイル時間 | 2,172 ms |
コンパイル使用メモリ | 214,724 KB |
実行使用メモリ | 29,056 KB |
最終ジャッジ日時 | 2024-11-27 08:45:56 |
合計ジャッジ時間 | 12,667 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 1 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | WA | - |
testcase_06 | AC | 2 ms
5,248 KB |
testcase_07 | AC | 2 ms
5,248 KB |
testcase_08 | AC | 1 ms
5,248 KB |
testcase_09 | WA | - |
testcase_10 | AC | 3 ms
5,248 KB |
testcase_11 | AC | 2 ms
5,248 KB |
testcase_12 | AC | 3 ms
5,248 KB |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | TLE | - |
testcase_17 | TLE | - |
testcase_18 | AC | 3 ms
5,248 KB |
testcase_19 | WA | - |
testcase_20 | WA | - |
evil_0.txt | WA | - |
ソースコード
#include <bits/stdc++.h> #define show(x) cerr << #x << " = " << x << endl using namespace std; using ll = long long; using pii = pair<int, int>; using vi = vector<int>; template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { os << "sz=" << v.size() << "\n["; for (const auto& p : v) { os << p << ","; } os << "]\n"; return os; } template <typename S, typename T> ostream& operator<<(ostream& os, const pair<S, T>& p) { os << "(" << p.first << "," << p.second << ")"; return os; } constexpr ll MOD = 1e9 + 7; template <typename T> constexpr T INF = numeric_limits<T>::max() / 100; template <typename Container, typename HashType = ll, HashType mod1 = static_cast<HashType>(1000000007), HashType mod2 = static_cast<HashType>(1000000009), HashType add1 = static_cast<HashType>(1000010007), HashType add2 = static_cast<HashType>(1003333331)> class RollingHash { public: static constexpr HashType MOD1 = mod1; static constexpr HashType MOD2 = mod2; using T = HashType; RollingHash(const Container& original) : size(original.size()), mt{random_device{}()}, base1{getRand1()}, base2{getRand2()}, pow1(size + 1, 1), pow2(size + 1, 1), accum_hash1(size + 1, 0), accum_hash2(size + 1, 0) { for (int i = 1; i <= size; i++) { pow1[i] = (pow1[i - 1] * base1) % mod1; accum_hash1[i] = (accum_hash1[i - 1] * base1 + add1 + static_cast<T>(original[i - 1])) % mod1; } for (int i = 1; i <= size; i++) { pow2[i] = (pow2[i - 1] * base2) % mod2; accum_hash2[i] = (accum_hash2[i - 1] * base2 + add2 + static_cast<T>(original[i - 1])) % mod2; } } pair<T, T> getHash(const int l, const int r) const // [l,r) { const T h1 = (((accum_hash1[r] - accum_hash1[l] * pow1[r - l]) % mod1) + mod1) % mod1; const T h2 = (((accum_hash2[r] - accum_hash2[l] * pow2[r - l]) % mod2) + mod2) % mod2; return make_pair(h1, h2); } private: T getRand1() { static T value = 0; static uniform_int_distribution<T> dist{2, mod1 - 1}; if (value == 0) { value = dist(mt); } return value; } T getRand2() { static T value = 0; static uniform_int_distribution<T> dist{2, mod2 - 1}; if (value == 0) { value = dist(mt); } return value; } const int size; mt19937 mt; const T base1; const T base2; vector<T> pow1; vector<T> pow2; vector<T> accum_hash1; vector<T> accum_hash2; }; map<string, ll> mp; ll rec(const string& s, const int l, const string& s1, const RollingHash<string>& hash) { cerr << l << " " << s1 << endl; if (mp.find(s1) != mp.end()) { return mp[s1]; } ll sum = 1; for (int i = 1; 2 * (l + i) < s.size() + 1; i++) { if (hash.getHash(l, l + i) == hash.getHash(s.size() - l - i, s.size() - l)) { const ll v = rec(s, l + i, s.substr(l + i, s.size() - l - i - l - i), hash); // show(v); sum += v; } } mp[s1] = sum; return sum; } int main() { cin.tie(0); ios::sync_with_stdio(false); string s; cin >> s; // mp[""] = 1; RollingHash<string> hash(s); cout << rec(s, 0, s, hash) << endl; return 0; }