oj.uz

Submission #712990

# Submission time Handle Problem Language Result Execution time Memory
712990 2023-03-20T18:12:27 Z Johann Palindromic Partitions (CEOI17_palindromic) C++14
100 / 100
 215 ms 30144 KB 
#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef tuple<int, int, int> tiii;
typedef vector<tiii> vtiii;
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()

const ll MOD = 1e9 + 7;
const ll P = 61687;

vi pot;
vi pref;
void initHashes(string &s)
{
    int n = sz(s);
    pot.assign(n + 10, 1);
    for (int i = 1; i < sz(pot); ++i)
        pot[i] = (pot[i - 1] * P) % MOD;
    pref.assign(n + 1, 0);
    for (int i = n - 1; i >= 0; --i)
        pref[i] = (P * pref[i + 1] + s[i]) % MOD;
}
ll hashString(int l, int r)
{
    assert(l <= r);
    ll h = (pref[l] - pref[r] * pot[r - l]) % MOD;
    return (h + MOD) % MOD;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int T;
    cin >> T;
    while (T--)
    {
        string s;
        cin >> s;
        initHashes(s);

        int ans = 0;
        int l0 = 0, r0 = sz(s);
        int l = 0, r = sz(s);

        while (r - l > 1)
        {
            ++l, --r;
            if (hashString(l0, l) == hashString(r, r0))
            {
                ans += 2;
                l0 = l, r0 = r;
            }
        }
        if (r0 - l0 > 0)
            ++ans;
        cout << ans << "\n";
    }

    return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 3 ms 680 KB Output is correct
13 Correct 3 ms 528 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 3 ms 680 KB Output is correct
13 Correct 3 ms 528 KB Output is correct
14 Correct 215 ms 28460 KB Output is correct
15 Correct 131 ms 30144 KB Output is correct
16 Correct 210 ms 29396 KB Output is correct
17 Correct 123 ms 15120 KB Output is correct