# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
309864 | peuch | Palindromic Partitions (CEOI17_palindromic) | C++17 | 709 ms | 131076 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;
const int MAXN = 1e6 + 10;
int t;
int n;
string st1;
int cnt;
map<string, int> marc;
int main(){
scanf("%d", &t);
while(t--){
cin >> st1;
n = st1.size();
string aux1 = "";
string aux2 = "";
int ans = 0;
for(int i = 0; i < n / 2; i++){
aux1 += st1[i];
aux2 = st1[n - i - 1] + aux2;
if(marc[aux1] == 0) marc[aux1] = ++cnt;
if(marc[aux2] == 0) marc[aux2] = ++cnt;
if(marc[aux1] == marc[aux2]) {
ans += 2;
aux1 = "";
aux2 = "";
}
}
if(n % 2 == 1) ans++;
else if(aux1.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... |