oj.uz

Submission #592977

# Submission time Handle Problem Language Result Execution time Memory
592977 2022-07-10T03:15:33 Z Hanksburger Palindromic Partitions (CEOI17_palindromic) C++17
0 / 100
 11 ms 8148 KB 
#include <bits/stdc++.h>
using namespace std;
const long long mod=1e9+7;
long long power[1000005];
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    power[0]=1;
    for (long long i=1; i<=1e6; i++)
        power[i]=power[i-1]*26%mod;
    long long t;
    cin >> t;
    while (t--)
    {
        string str;
        cin >> str;
        long long len=str.length(), x=0, y=0, cnt=0, ans=0;
        for (long long i=0; i<len/2; i++)
        {
            x=(x*26+str[i]-'a')%mod;
            y=(y+(str[len-i-1]-'a')*power[cnt])%mod;
            cnt++;
            if (x==y)
            {
                ans+=2;
                x=y=cnt=0;
            }
        }
        cout << ans+(x || len&1) << '\n';
    }
    return 0;
}

Subtask #1
0 / 15.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 25.0

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

Subtask #4
0 / 40.0

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