oj.uz

Submission #977676

# Submission time Handle Problem Language Result Execution time Memory
977676 2024-05-08T09:04:44 Z berr Palindromic Partitions (CEOI17_palindromic) C++17
100 / 100
 85 ms 19728 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=2e5+29;
const int mod = 1e9+7;
 
 
int mul(int x, int y){
    x*=y;
    x-=(x/mod)*mod;
    return x;
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
 
    int t; cin >> t;
    vector<int> p(1e6+38);
    p[0] = 1;
    for(int i=1; i<=1e6; i++){
        p[i] = mul(p[i-1], 29);
    }
 
 
    while(t--){
        string s; cin >> s;
        int n = s.size();
        int sum=0, ans=0;
        vector<int> va(n);

        for(int i=0; i<n; i++){
            sum+=mul((s[i]-'a'+1),p[i+1]);
            if(sum>=mod) sum-=mod;
            va[i]=sum;
        }
 
        int s2=0, l=0, plast=n;
        int siz=0;
        for(int i=n-1; i>=n/2; i--){
            s2=mul(s2, 29);
            s2+=mul((s[i]-'a'+1), 29);
            if(s2>=mod) s2-=mod;
            int val= (l+ mul(s2, p[n-plast]));
            if(val>=mod) val-=mod;

            if(val==va[n-i-1]){
                ans+=2; 
                siz+=(plast-i)*2;
                if(siz>n) ans--, siz-=(plast-i);
                l=val;
                s2=0;
                plast=i;
            }
        }
 
        if(siz!=n) ans++;
        cout<<ans<<"\n";
    }
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8436 KB Output is correct
2 Correct 9 ms 8284 KB Output is correct
3 Correct 9 ms 8284 KB Output is correct
4 Correct 9 ms 8284 KB Output is correct
5 Correct 11 ms 8284 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8436 KB Output is correct
2 Correct 9 ms 8284 KB Output is correct
3 Correct 9 ms 8284 KB Output is correct
4 Correct 9 ms 8284 KB Output is correct
5 Correct 11 ms 8284 KB Output is correct
6 Correct 10 ms 8296 KB Output is correct
7 Correct 9 ms 8296 KB Output is correct
8 Correct 9 ms 8284 KB Output is correct
9 Correct 10 ms 8280 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8436 KB Output is correct
2 Correct 9 ms 8284 KB Output is correct
3 Correct 9 ms 8284 KB Output is correct
4 Correct 9 ms 8284 KB Output is correct
5 Correct 11 ms 8284 KB Output is correct
6 Correct 10 ms 8296 KB Output is correct
7 Correct 9 ms 8296 KB Output is correct
8 Correct 9 ms 8284 KB Output is correct
9 Correct 10 ms 8280 KB Output is correct
10 Correct 10 ms 8300 KB Output is correct
11 Correct 10 ms 8284 KB Output is correct
12 Correct 10 ms 8284 KB Output is correct
13 Correct 10 ms 8252 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8436 KB Output is correct
2 Correct 9 ms 8284 KB Output is correct
3 Correct 9 ms 8284 KB Output is correct
4 Correct 9 ms 8284 KB Output is correct
5 Correct 11 ms 8284 KB Output is correct
6 Correct 10 ms 8296 KB Output is correct
7 Correct 9 ms 8296 KB Output is correct
8 Correct 9 ms 8284 KB Output is correct
9 Correct 10 ms 8280 KB Output is correct
10 Correct 10 ms 8300 KB Output is correct
11 Correct 10 ms 8284 KB Output is correct
12 Correct 10 ms 8284 KB Output is correct
13 Correct 10 ms 8252 KB Output is correct
14 Correct 85 ms 19728 KB Output is correct
15 Correct 60 ms 18740 KB Output is correct
16 Correct 82 ms 18796 KB Output is correct
17 Correct 45 ms 13808 KB Output is correct