oj.uz

Submission #1103892

# Submission time Handle Problem Language Result Execution time Memory
1103892 2024-10-22T06:29:56 Z ezzzay Palindromic Partitions (CEOI17_palindromic) C++14
60 / 100
 10000 ms 6584 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define pb push_back
vector<int>ans;
void fun(){
    string s;
    cin>>s;
    int n=s.size();
    string a,b;
    int x=-1;
    int p=0;
    for(int i=0;i<n/2;i++){
        a+=s[i];
        b=s[n-i-1]+b;
        if(a==b){
            x=i;
            a.clear();
            b.clear();
            p+=2;
        }
        //cout<<a<<" "<<b<<endl;
    }
    if(n%2 or x<n/2-1)p++;
    ans.pb(p);
}
signed main(){
    int t;
    cin>>t;
    while(t--)fun();
    for(auto a:ans)cout<<a<<endl;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 4 ms 592 KB Output is correct
11 Correct 3 ms 592 KB Output is correct
12 Correct 4 ms 504 KB Output is correct
13 Correct 3 ms 336 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 4 ms 592 KB Output is correct
11 Correct 3 ms 592 KB Output is correct
12 Correct 4 ms 504 KB Output is correct
13 Correct 3 ms 336 KB Output is correct
14 Execution timed out 10031 ms 6584 KB Time limit exceeded
15 Halted 0 ms 0 KB -