oj.uz

Submission #853328

# Submission time Handle Problem Language Result Execution time Memory
853328 2023-09-24T06:51:21 Z manizare Palindromic Partitions (CEOI17_palindromic) C++14
60 / 100
 493 ms 3876 KB 
#include <bits/stdc++.h> 
 
#pragma GCC optimize("O3,unroll-loops")
#define pb push_back
#define F first
#define S second 
#define all(a) a.begin(),a.end()
#define pii pair <int,int>
#define Pii pair< pii , pii >
#define ll long long
 
using namespace std ;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
const int maxn = 10002 + 10 , maxq = 1e7 + 1 ,  inf = 1e8 + 10 , mod= 998244353 ,lg = 20 ;
int lcp[maxn] ,dp[maxn]  ;  
signed main(){
  ios::sync_with_stdio(false); cin.tie(0) ;
  int t; 
  cin >> t ;
  while(t--){
    string s ;
    cin >> s ;
    int n = (int)s.size() ;
    s = " " + s; 
    for(int i = 1; i <= n ; i++)dp[i] = 0 ;
    if(n%2==1)dp[n/2+1] = 1 ;
    for(int i = n/2 ; i >= 1 ; i--){
      int k =0 ;
      lcp[i] = 0;
      dp[i] = 1;
      for(int j = i+1 ; j <= n/2 ; j++){
        while(k!=0 && s[i+k] != s[j]){
          k = lcp[i+k-1] ; 
        }
        if(s[i+k] == s[j])k++;
        lcp[j]= k ;
      }
      k =0  ;
      for(int j = n+1 - n/2 ; j <= n-i+1 ; j++){
        while(k!=0 && s[j] != s[i+k]){
          k = lcp[i+k-1] ;
        }
        if(s[i+k] == s[j])k++;
        lcp[j] = k ;
      }
      k = lcp[n-i+1] ;
      while(k!=0){
        dp[i] = max(dp[i] , dp[i+k] + 2) ;
        k = lcp[k+i-1];
      }
      
    }
    cout << dp[1] << "\n"; 
  }
}
/*
 
*/

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 493 ms 596 KB Output is correct
11 Correct 299 ms 852 KB Output is correct
12 Correct 244 ms 600 KB Output is correct
13 Correct 204 ms 604 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 493 ms 596 KB Output is correct
11 Correct 299 ms 852 KB Output is correct
12 Correct 244 ms 600 KB Output is correct
13 Correct 204 ms 604 KB Output is correct
14 Runtime error 4 ms 3876 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -