# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
309488 | 2020-10-03T16:32:34 Z | Kenzo_1114 | Palindromic Partitions (CEOI17_palindromic) | C++17 | 10 ms | 8192 KB |
#include<bits/stdc++.h> using namespace std; const int MAXN = 1000010; const long long int MOD = 1e9 + 19; int t; long long int p[MAXN], sp[MAXN]; string s; void init() { p[0] = 1; for(int i = 1; i < MAXN; i++) p[i] = (p[i - 1] * 23) % MOD; } long long int Hash(int i, int j) { long long int h = (sp[j] - sp[i - 1] + MOD) * p[i]; return h % MOD; } void solve() { cin >> s; int sz = (int) s.size(); for(int i = 0; i < sz; i++) { sp[i] = (p[sz - i - 1] * (s[i] - 'a')) % MOD; if(i) sp[i] = (sp[i - 1] + sp[i]) % MOD; } int l = 0, r = sz - 1, ans = 0; while(l <= r) { if(l == r) ans--; if(s[l] == s[r]) l++, r--; else for(int k = 1; k <= sz; k++) if(Hash(l, l + k) == Hash(r - k, r)) { l += k + 1, r -= k + 1; if(r < l) ans--; break; } ans += 2; } printf("%d\n", ans); } int main () { init(); scanf("%d", &t); while(t--) solve(); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 10 ms | 8192 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 10 ms | 8192 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 10 ms | 8192 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 10 ms | 8192 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |