oj.uz

답안 #1094549

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1094549 2024-09-29T22:18:48 Z raphaelp Palindromic Partitions (CEOI17_palindromic) C++14
100 / 100
 200 ms 12168 KB 
#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.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 200 ms 12168 KB Output is correct
15 Correct 104 ms 7280 KB Output is correct
16 Correct 176 ms 11436 KB Output is correct
17 Correct 92 ms 6852 KB Output is correct