# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
936051 | Aiperiii | Palindromic Partitions (CEOI17_palindromic) | C++14 | 10005 ms | 23952 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>
#define int long long
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
signed main(){
int t;
cin>>t;
while(t--){
vector <int> mp[130];
string s;
cin>>s;
string t=s;
reverse(all(t));
int ans=0;
for(int i=0;i<s.size();i++){
mp[(int)s[i]].pb(i);
}
for(int i=0;i<t.size();i++){
if(s[i]==t[i])ans++;
else{
auto pos=upper_bound(all(mp[(int)t[i]]),i)-mp[(int)t[i]].begin();
for(int j=pos;j<mp[(int)t[i]].size();j++){
bool ok=1;
int x=0;
for(int k=i;k<=mp[(int)t[i]][j];k++){
if(t[k]!=s[mp[(int)t[i]][j]-x]){
ok=0;break;
}
x++;
}
if(ok){
ans++;
i=mp[(int)t[i]][j];
break;
}
}
}
}
cout<<ans<<"\n";
}
}
/*
4
bonobo
deleted
racecar
racecars
*/
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... |