oj.uz

Submission #563250

# Submission time Handle Problem Language Result Execution time Memory
563250 2022-05-16T15:10:28 Z kawaii Palindromic Partitions (CEOI17_palindromic) C++14
100 / 100
 1284 ms 20776 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define hash hsh

int t, n, m, k, hash[1000005], base = 353, mod = 696969601;
string s;
mt19937_64 rng;

int mul(int x, int y){
    if(y == 0) return 1;
    int ans = mul(x, y / 2);
    if(y % 2 == 0) return (ans * ans) % mod;
    else return (((ans * ans) % mod) * x) % mod;
}

void solve(){
    n = s.size();
    s = '0' + s;
    for(int i = 1; i <= n; i++) hash[i] = (hash[i - 1] * base + s[i]) % mod; 
    int cnt = 1, ans = 0;
    while(cnt <= n - cnt + 1){ 
        int f = cnt;
        bool flag = 0;
        while(1){
            int num1 = (hash[cnt] - (hash[f - 1] * mul(base, cnt - f + 1)) % mod) % mod;
            int num2 = (hash[n - f + 1] - (hash[n - cnt] * mul(base, cnt - f + 1)) % mod) % mod;
            // cout << cnt <<" "<< n - cnt + 1 <<" "<< num1 <<" "<< num2 <<" "<< ans << endl;
            if((num1 + mod) % mod == (num2 + mod) % mod){
                if(cnt == n - cnt + 1) ans++;
                else ans += 2; 
                cnt++; flag = 1; break;
            }
            cnt++;
            if(cnt > n - cnt + 1) break;
        }
        if(!flag){
            ans++; break;
        } 
    }
    cout << ans << "\n";
}

signed main(){
    ios_base::sync_with_stdio(NULL); cin.tie(nullptr); cout.tie(nullptr);
    // rng.seed((int)main ^ time(0));
    #ifdef Kawaii
        auto starttime = chrono::high_resolution_clock::now();
    #endif

    cin >> t;
    while(t--){
        cin >> s;
        solve();
    }

    #ifdef Kawaii
        auto endtime = chrono::high_resolution_clock::now();
        auto duration = chrono::duration_cast<chrono::milliseconds>(endtime - starttime).count(); 
        cout << "\n=====" << "\nUsed: " << duration << " ms\n";
    #endif
}

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 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 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 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 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 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 9 ms 440 KB Output is correct
11 Correct 8 ms 464 KB Output is correct
12 Correct 10 ms 468 KB Output is correct
13 Correct 5 ms 468 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 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 9 ms 440 KB Output is correct
11 Correct 8 ms 464 KB Output is correct
12 Correct 10 ms 468 KB Output is correct
13 Correct 5 ms 468 KB Output is correct
14 Correct 1210 ms 19800 KB Output is correct
15 Correct 1064 ms 15028 KB Output is correct
16 Correct 1284 ms 20776 KB Output is correct
17 Correct 217 ms 10560 KB Output is correct