oj.uz

Submission #582936

# Submission time Handle Problem Language Result Execution time Memory
582936 2022-06-24T15:29:37 Z 600Mihnea Palindromic Partitions (CEOI17_palindromic) C++17
35 / 100
 10000 ms 432 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long double ld;
typedef long long ll;

const int N = (int) 1e6 + 7;
int n;
int a[N];
int mx[N];

signed main() {
  ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

  ///freopen ("input.txt", "r", stdin);

  int Tests;
  cin >> Tests;
  for (int tc = 1; tc <= Tests; tc++) {
      {
      string str;
      cin >> str;
      n = (int) str.size();
      for (int i = 0; i < n; i++) {
        char ch = str[i];
        assert('a' <= ch && ch <= 'z');
        a[i] = ch - 'a';
        assert(0 <= a[i] && a[i] < 26);
      }
      for (int i = 0; i <= n + 1; i++) {
        mx[i] = 0;
      }
      for (int i = 0; i <= (n - 1) / 2; i++) {
        mx[i] = 1;
      }
      /// interval[i] = [i, n - 1 - i]

      for (int i = (n - 1) / 2; i >= 0; i--) {
        if (i == n - 1 - i) {
          continue;
        }
        for (int j = i; j <= n - 1 - j; j++) {
          /// interval[i] = [i, n - 1 - i]
          /// interval[j] = [j, n - 1 - j]
          bool ok = 1;
          for (int k = i; k <= j; k++) {
            ok &= (a[k] == a[n - 1 - j + k - i]);
          }
          if (ok) {
            mx[i] = max(mx[i], 2 + mx[j + 1]);
          }
        }
      }
      cout << mx[0] << "\n";
    }
  }
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 324 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 5 ms 340 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 4 ms 340 KB Output is correct
9 Correct 5 ms 340 KB Output is correct

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 5 ms 340 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 4 ms 340 KB Output is correct
9 Correct 5 ms 340 KB Output is correct
10 Execution timed out 10061 ms 432 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 5 ms 340 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 4 ms 340 KB Output is correct
9 Correct 5 ms 340 KB Output is correct
10 Execution timed out 10061 ms 432 KB Time limit exceeded
11 Halted 0 ms 0 KB -