oj.uz

Submission #318310

# Submission time Handle Problem Language Result Execution time Memory
318310 2020-11-01T05:57:34 Z Nima_Naderi Palindromic Partitions (CEOI17_palindromic) C++14
100 / 100
 980 ms 53388 KB 
///In the name of GOD
#pragma GCC optimize("O2")
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll MXN = 1e6 + 10;
const ll MXH = 3;
const vector<ll> Mab = {1448387, 2888387, 8387};
const vector<ll> Mod = {1000000087, (ll)1e9 + 7, (ll)1e9 + 9};
ll q, n;
ll pw[MXH][MXN], Hash[MXH][MXN];
string s;
ll Get(ll b, ll l, ll r){
    return (Hash[b][r] - Hash[b][l - 1] * pw[b][r - l + 1] % Mod[b] + Mod[b]) % Mod[b];
}
bool Check(ll l1, ll r1, ll l2, ll r2){
    bool f = true;
    for(int b = 0; b < MXH; b ++){
        f &= (Get(b, l1, r1) == Get(b, l2, r2));
    }
    return f;
}
void solve(){
    cin >> s, n = s.size();
    s = "$" + s;
    for(int b = 0; b < MXH; b ++)
        for(int i = 1; i <= n; i ++)
            Hash[b][i] = (Hash[b][i - 1] * Mab[b] % Mod[b] + (s[i] - 'a' + 1)) % Mod[b];
    ll l = 1, r = n, ans = 0;
    while(l < r){
        ll nxtl = -1, nxtr = -1;
        for(int len = 1; l + len - 1 < r - len + 1; len ++){
            if(Check(l, l + len - 1, r - len + 1, r)){
                nxtl = l + len, nxtr = r - len;
                break;
            }
        }
        if(nxtl == -1){
            ans ++; break;
        }
        l = nxtl, r = nxtr, ans += 2;
    }
    if(l == r) ans ++;
    cout << ans << '\n';
}
int main(){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    for(int b = 0; b < MXH; b ++){
        pw[b][0] = 1;
        for(int i = 1; i < MXN; i ++)
            pw[b][i] = pw[b][i - 1] * Mab[b] % Mod[b];
    }
    cin >> q;
    while(q --) solve();
    return 0;
}
/*!
    HE'S AN INSTIGATOR,
    ENEMY ELIMINATOR,
    AND WHEN HE KNOCKS YOU BETTER
    YOU BETTER LET HIM IN.
*/
//! N.N

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 23908 KB Output is correct
2 Correct 37 ms 23780 KB Output is correct
3 Correct 37 ms 23864 KB Output is correct
4 Correct 37 ms 23780 KB Output is correct
5 Correct 38 ms 23856 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 23908 KB Output is correct
2 Correct 37 ms 23780 KB Output is correct
3 Correct 37 ms 23864 KB Output is correct
4 Correct 37 ms 23780 KB Output is correct
5 Correct 38 ms 23856 KB Output is correct
6 Correct 37 ms 23908 KB Output is correct
7 Correct 37 ms 23908 KB Output is correct
8 Correct 38 ms 23908 KB Output is correct
9 Correct 39 ms 23908 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 23908 KB Output is correct
2 Correct 37 ms 23780 KB Output is correct
3 Correct 37 ms 23864 KB Output is correct
4 Correct 37 ms 23780 KB Output is correct
5 Correct 38 ms 23856 KB Output is correct
6 Correct 37 ms 23908 KB Output is correct
7 Correct 37 ms 23908 KB Output is correct
8 Correct 38 ms 23908 KB Output is correct
9 Correct 39 ms 23908 KB Output is correct
10 Correct 46 ms 24164 KB Output is correct
11 Correct 42 ms 24164 KB Output is correct
12 Correct 48 ms 24312 KB Output is correct
13 Correct 45 ms 24292 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 23908 KB Output is correct
2 Correct 37 ms 23780 KB Output is correct
3 Correct 37 ms 23864 KB Output is correct
4 Correct 37 ms 23780 KB Output is correct
5 Correct 38 ms 23856 KB Output is correct
6 Correct 37 ms 23908 KB Output is correct
7 Correct 37 ms 23908 KB Output is correct
8 Correct 38 ms 23908 KB Output is correct
9 Correct 39 ms 23908 KB Output is correct
10 Correct 46 ms 24164 KB Output is correct
11 Correct 42 ms 24164 KB Output is correct
12 Correct 48 ms 24312 KB Output is correct
13 Correct 45 ms 24292 KB Output is correct
14 Correct 980 ms 53388 KB Output is correct
15 Correct 535 ms 51480 KB Output is correct
16 Correct 977 ms 52860 KB Output is correct
17 Correct 540 ms 39268 KB Output is correct