# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
582935 | 2022-06-24T15:29:26 Z | 600Mihnea | Palindromic Partitions (CEOI17_palindromic) | C++17 | 2 ms | 340 KB |
#include <bits/stdc++.h> using namespace std; typedef long double ld; typedef long long ll; const int N = (int) 1e6 + 7; int n; int a[N]; int mx[N]; signed main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); freopen ("input.txt", "r", stdin); int Tests; cin >> Tests; for (int tc = 1; tc <= Tests; tc++) { { string str; cin >> str; n = (int) str.size(); for (int i = 0; i < n; i++) { char ch = str[i]; assert('a' <= ch && ch <= 'z'); a[i] = ch - 'a'; assert(0 <= a[i] && a[i] < 26); } for (int i = 0; i <= n + 1; i++) { mx[i] = 0; } for (int i = 0; i <= (n - 1) / 2; i++) { mx[i] = 1; } /// interval[i] = [i, n - 1 - i] for (int i = (n - 1) / 2; i >= 0; i--) { if (i == n - 1 - i) { continue; } for (int j = i; j <= n - 1 - j; j++) { /// interval[i] = [i, n - 1 - i] /// interval[j] = [j, n - 1 - j] bool ok = 1; for (int k = i; k <= j; k++) { ok &= (a[k] == a[n - 1 - j + k - i]); } if (ok) { mx[i] = max(mx[i], 2 + mx[j + 1]); } } } cout << mx[0] << "\n"; } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 340 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |