# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
310385 | pedroslrey | Palindromic Partitions (CEOI17_palindromic) | C++17 | 10018 ms | 6268 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define debug(args...) //fprintf(stderr, args)
const int MAXN = 1e6 + 10;
char xs[MAXN];
int main() {
int t;
scanf("%d", &t);
while (t--) {
scanf("%s", xs);
int n = strlen(xs);
string s = "";
string t = "";
int ans = 0;
for (int i = 0; i < n / 2; ++i) {
s += xs[i];
t = xs[n - i - 1] + t;
if (s == t) {
ans += 2;
s.clear();
t.clear();
}
}
if (n % 2 == 1 || s.size() != 0) ans++;
printf("%d\n", ans);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |