oj.uz

Submission #97287

# Submission time Handle Problem Language Result Execution time Memory
97287 2019-02-14T18:59:54 Z dalgerok Palindromic Partitions (CEOI17_palindromic) C++14
100 / 100
 176 ms 28940 KB 
#include<bits/stdc++.h>
using namespace std;


const int N = 1e6 + 5, MOD1 = 1e9 + 1337, MOD2 = 999888777;



string s;
int n, p1[N], p2[N], h1[N], h2[N];

inline pair < int, int > get_hash(int l, int r){
    int cur1 = 1LL * (h1[r] - h1[l - 1] + MOD1) % MOD1 * p1[N - r] % MOD1,
        cur2 = 1LL * (h2[r] - h2[l - 1] + MOD2) % MOD2 * p2[N - r] % MOD2;
    return make_pair(cur1, cur2);
}

inline void solve(){
    cin >> s;
    n = (int)s.size();
    s = '#' + s;
    for(int i = 1; i <= n; i++){
        h1[i] = (h1[i - 1] + 1LL * (s[i] - 'a' + 1) * p1[i] % MOD1) % MOD1;
        h2[i] = (h2[i - 1] + 1LL * (s[i] - 'a' + 1) * p2[i] % MOD2) % MOD2;
    }
    int l = 1, r = n, ans = 0;
    while(l <= r){
        for(int len = 1; l + len - 1 < r - len + 1; len++){
            if(get_hash(l, l + len - 1) == get_hash(r - len + 1, r)){
                ans += 2;
                l += len;
                r -= len;
                goto to;
            }
        }
        ans += 1;
        break;
        to:;
    }
    cout << ans << "\n";
}

int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    p1[0] = p2[0] = 1;
    for(int i = 1; i < N; i++){
        p1[i] = 1LL * p1[i - 1] * 59 % MOD1;
        p2[i] = 1LL * p2[i - 1] * 45 % MOD2;
    }
    int test;
    cin >> test;
    while(test--){
        solve();
    }
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 8192 KB Output is correct
2 Correct 15 ms 8256 KB Output is correct
3 Correct 13 ms 8192 KB Output is correct
4 Correct 13 ms 8192 KB Output is correct
5 Correct 15 ms 8192 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 8192 KB Output is correct
2 Correct 15 ms 8256 KB Output is correct
3 Correct 13 ms 8192 KB Output is correct
4 Correct 13 ms 8192 KB Output is correct
5 Correct 15 ms 8192 KB Output is correct
6 Correct 13 ms 8192 KB Output is correct
7 Correct 13 ms 8192 KB Output is correct
8 Correct 15 ms 8320 KB Output is correct
9 Correct 13 ms 8192 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 8192 KB Output is correct
2 Correct 15 ms 8256 KB Output is correct
3 Correct 13 ms 8192 KB Output is correct
4 Correct 13 ms 8192 KB Output is correct
5 Correct 15 ms 8192 KB Output is correct
6 Correct 13 ms 8192 KB Output is correct
7 Correct 13 ms 8192 KB Output is correct
8 Correct 15 ms 8320 KB Output is correct
9 Correct 13 ms 8192 KB Output is correct
10 Correct 18 ms 8420 KB Output is correct
11 Correct 14 ms 8324 KB Output is correct
12 Correct 16 ms 8448 KB Output is correct
13 Correct 15 ms 8448 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 8192 KB Output is correct
2 Correct 15 ms 8256 KB Output is correct
3 Correct 13 ms 8192 KB Output is correct
4 Correct 13 ms 8192 KB Output is correct
5 Correct 15 ms 8192 KB Output is correct
6 Correct 13 ms 8192 KB Output is correct
7 Correct 13 ms 8192 KB Output is correct
8 Correct 15 ms 8320 KB Output is correct
9 Correct 13 ms 8192 KB Output is correct
10 Correct 18 ms 8420 KB Output is correct
11 Correct 14 ms 8324 KB Output is correct
12 Correct 16 ms 8448 KB Output is correct
13 Correct 15 ms 8448 KB Output is correct
14 Correct 176 ms 27740 KB Output is correct
15 Correct 103 ms 22972 KB Output is correct
16 Correct 154 ms 28940 KB Output is correct
17 Correct 119 ms 18488 KB Output is correct