oj.uz

Submission #1103893

# Submission time Handle Problem Language Result Execution time Memory
1103893 2024-10-22T06:35:54 Z ezzzay Palindromic Partitions (CEOI17_palindromic) C++14
100 / 100
 169 ms 10800 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();
    int a=0,b=0;
    int x=-1;
    int p=0;
    int k=1;
    int m=1e9+7;
    int mlt=1;
    for(int i=0;i<n/2;i++){
        a= a*(31)+(s[i]);
        a%=m;
        
        b=(s[n-i-1])*mlt+b;
        b%=m;
        
        mlt*=31;
        mlt%=m;
        if(a==b){
            x=i;
            a=0,b=0;
            k=1;
            p+=2;
            mlt=1;
        }
        //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;
}

Compilation message

palindromic.cpp: In function 'void fun()':
palindromic.cpp:15:9: warning: variable 'k' set but not used [-Wunused-but-set-variable]
   15 |     int k=1;
      |         ^

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 0 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 0 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 0 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 2 ms 336 KB Output is correct
11 Correct 2 ms 336 KB Output is correct
12 Correct 2 ms 336 KB Output is correct
13 Correct 2 ms 336 KB Output is correct

Subtask #4
40.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 0 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 2 ms 336 KB Output is correct
11 Correct 2 ms 336 KB Output is correct
12 Correct 2 ms 336 KB Output is correct
13 Correct 2 ms 336 KB Output is correct
14 Correct 166 ms 7536 KB Output is correct
15 Correct 90 ms 6748 KB Output is correct
16 Correct 169 ms 10800 KB Output is correct
17 Correct 89 ms 6800 KB Output is correct