oj.uz

Submission #128037

# Submission time Handle Problem Language Result Execution time Memory
128037 2019-07-10T10:47:58 Z faustaadp Palindromic Partitions (CEOI17_palindromic) C++17
0 / 100
 2 ms 376 KB 
#include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
string s,s1,s2;
ll n,i,has,t;
int main()
{
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>t;
	while(t--)
	{
		has=1;
		cin>>s;
		n=s.length();
		s1="";
		s2="";
		for(i=0;i<n;i++)
		{
			if(i>=(n-i-1))break;
			s1=s1+s[i];
			s2=s[n-i-1]+s2;
			if(s1==s2)
			{
				has+=2;
				s1="";
				s2="";
			}
		}
		cout<<has<<"\n";
	}
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -