# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
217847 | aloo123 | Palindromic Partitions (CEOI17_palindromic) | C++14 | 5 ms | 384 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 ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll,ll>
#define all(x) (x).begin() , (x).end()
#define f first
#define s second
using namespace std;
const ll N =(2e5+5);
const ll MOD = 998244353;
const ll INF = 1e16;
const ll LOG = 25;
long long binpow(long long a, long long b) {
a %= MOD;
long long res = 1;
while (b > 0) {
if (b & 1)
res = (res * a)%MOD ;
a = (a * a)%MOD ;
b >>= 1;
}
res%=MOD;
return res;
}
void solve(){
string s;
cin>>s;
ll n = (ll)s.size();
//cout<<n<<endl;
ll l= 0,r= n -1;
string a;
string b;
ll ans = 0;
ll x,y;
while(l < r){
a+=s[l];
b+=s[r];
string c =b;reverse(all(c));
if(c == a){
ans += 2;
a="";
b="";
x = l,y =r;
// cout<<l<<" "<<r<<endl;
}
l++,r--;
}
// for(int i = x+1;i<y;i++)cout<<s[i];cout<<endl;
// cout<<l<<" "<<r<<endl;
if((x+1)<=(y-1))
ans++;
cout<<ans<<endl;
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(NULL);
ll t;cin>>t;
while(t--){
solve();
}
return 0;
}
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... |