oj.uz

Submission #738220

# Submission time Handle Problem Language Result Execution time Memory
738220 2023-05-08T09:26:06 Z study Palindromic Partitions (CEOI17_palindromic) C++17
100 / 100
 1457 ms 28496 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

const int mod = 1e9+9, hash_val = 31, N = 1e6;

int hashn[N],pow31[N];

int power(int a, int b){
    int ans = 1;
    while (b){
        if (b&1) ans = (ans*a)%mod;
        a = (a*a)%mod;
        b >>= 1;
    }
    return ans;
}

int inv(int a){
    return power(a,mod-2);
}

int calc(int l, int r){
    if (l > r) return 0;
    int ans = hashn[r];
    if (l != 0) ans -= hashn[l-1];
    return (((ans+mod)%mod)*inv(pow31[l]))%mod;
}

int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
    pow31[0] = 1;
    for (int i=1; i<1e6; ++i){
        pow31[i] = (pow31[i-1]*hash_val)%mod;
    }
	int t;
    cin >> t;
    while (t--){
        string s;
        cin >> s;
        int ans = 0, res = 1, n = s.size(), l = 0, r = n-1;
        hashn[0] = s[0]-'a'+1;
        for (int i=1; i<n; ++i){
            hashn[i] = hashn[i-1]+pow31[i]*(s[i]-'a'+1);
            hashn[i] %= mod;
        }
        while (l < r){
            int L = l, R = r;
            while ((calc(L,l-1) != calc(r+1,R) or l == L) and l < r){
                l++; r--;
            }
            if (calc(L,l-1) != calc(r+1,R)) break;
            ans += 2;
            if (l <= r) res = max(res,ans+1);
            else res = max(res,ans);
        }
        cout << res << '\n';
    }
	return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 8148 KB Output is correct
2 Correct 10 ms 8148 KB Output is correct
3 Correct 10 ms 8036 KB Output is correct
4 Correct 11 ms 8148 KB Output is correct
5 Correct 10 ms 8152 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 8148 KB Output is correct
2 Correct 10 ms 8148 KB Output is correct
3 Correct 10 ms 8036 KB Output is correct
4 Correct 11 ms 8148 KB Output is correct
5 Correct 10 ms 8152 KB Output is correct
6 Correct 11 ms 8156 KB Output is correct
7 Correct 12 ms 8152 KB Output is correct
8 Correct 11 ms 8148 KB Output is correct
9 Correct 11 ms 8148 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 8148 KB Output is correct
2 Correct 10 ms 8148 KB Output is correct
3 Correct 10 ms 8036 KB Output is correct
4 Correct 11 ms 8148 KB Output is correct
5 Correct 10 ms 8152 KB Output is correct
6 Correct 11 ms 8156 KB Output is correct
7 Correct 12 ms 8152 KB Output is correct
8 Correct 11 ms 8148 KB Output is correct
9 Correct 11 ms 8148 KB Output is correct
10 Correct 27 ms 8348 KB Output is correct
11 Correct 18 ms 8276 KB Output is correct
12 Correct 25 ms 8336 KB Output is correct
13 Correct 22 ms 8276 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 8148 KB Output is correct
2 Correct 10 ms 8148 KB Output is correct
3 Correct 10 ms 8036 KB Output is correct
4 Correct 11 ms 8148 KB Output is correct
5 Correct 10 ms 8152 KB Output is correct
6 Correct 11 ms 8156 KB Output is correct
7 Correct 12 ms 8152 KB Output is correct
8 Correct 11 ms 8148 KB Output is correct
9 Correct 11 ms 8148 KB Output is correct
10 Correct 27 ms 8348 KB Output is correct
11 Correct 18 ms 8276 KB Output is correct
12 Correct 25 ms 8336 KB Output is correct
13 Correct 22 ms 8276 KB Output is correct
14 Correct 1457 ms 28496 KB Output is correct
15 Correct 776 ms 23564 KB Output is correct
16 Correct 1362 ms 27556 KB Output is correct
17 Correct 814 ms 18916 KB Output is correct