제출 #1094549

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1094549		raphaelp	Palindromic Partitions (CEOI17_palindromic)	C++14	100 / 100	200 ms	12168 KiB

palindromic

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int T;
    cin >> T;
    while (T--)
    {
        string S;
        cin >> S;
        int N = S.size() / 2;
        long long cur1 = 0, cur2 = 0;
        long long a = 832991340832991341, b = 934618349934618347, mult = 1;
        int last = -1;
        int nb = 0;
        for (int i = 0; i < N; i++)
        {
            cur1 = ((__int128_t)cur1 * a + S[i]) % b;
            cur2 = (cur2 + (__int128_t)mult * S[S.size() - i - 1]) % b;
            mult = ((__int128_t)mult * a) % b;
            if (cur1 == cur2)
            {
                last = i;
                cur1 = 0, cur2 = 0, mult = 1;
                nb += 2;
            }
        }
        if (S.size() % 2 || last < N - 1)
            nb++;
        cout << nb << '\n';
    }
}

• Subtask 1: 15 / 15
• Subtask 2: 20 / 20
• Subtask 3: 25 / 25
• Subtask 4: 40 / 40