CSES - Datatähti 2022 loppu - Results
Submission details
Task:Peli
Sender:hltk
Submission time:2022-01-22 21:34:41 +0200
Language:C++ (C++17)
Status:COMPILE ERROR

Compiler report

Output limit exceeded in compilation

Code

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("arch=hashwell")
#include <bits/stdc++.h>
using namespace std;
string s;
int ans;
const int N = 100001;
int t[3][2][51][51];
inline int &state(int i, int a, int b, int c) {
  if (!a) return t[0][i % 2][b][c];
  if (!b) return t[1][i % 2][a][c];
  return t[2][i % 2][a][b];
}
const int INF = 1e9;
inline void cmax(int &x, int y) {
  x = max(x, y);
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  if (k < 3) {
    cout << 0 << endl;
  } else {
    cin >> s;
    for (int a = 0; a <= k; ++a) {
      for (int b = 0; b <= k; ++b) {
        t[0][0][a][b] = -INF;
        t[1][0][a][b] = -INF;
        t[2][0][a][b] = -INF;
        t[0][1][a][b] = -INF;
        t[1][1][a][b] = -INF;
        t[2][1][a][b] = -INF;
      }
    }
    t[0][0][0][0] = 0;
    for (int i = 1; i <= n; ++i) {
      for (int a = 0; a <= k; ++a) {
        for (int b = 0; b <= k - a; ++b) {
          for (int c = 0; c <= k - a - b; ++c) {
            if (a && b && b) break;
            cmax(state(i, a, b, c), state(i - 1, a, b, c));
          }
        }
      }
      for (int a = 0; a <= k; ++a) {
        for (int b = 0; b <= k - a; ++b) {
          for (int c = 0; c <= k - a - b; ++c) {
            if (a && b && c) break;
            if (s[i - 1] == 'A') {
              if (b && c && a + b + c < k) {
                cmax(state(i, a, b - 1, c - 1), state(i - 1, a, b, c) + 1);
              }
              if (a + 1 <= k && a + b + c + 1 <= k && (!b || !c)) {
                cmax(state(i, a + 1, b, c), state(i - 1, a, b, c));
              }
            } else if (s[i - 1] == 'B') {
              if (a && c && a + b + c < k) {
                cmax(state(i, a - 1, b, c - 1), state(i - 1, a, b, c) + 1);
              }
              if (b + 1 <= k && a + b + c + 1 <= k && (!a || !c)) {
                cmax(state(i, a, b + 1, c), state(i - 1, a, b, c));
              }
            } else {
              if (a && b && a + b + c < k) {
                cmax(state(i, a - 1, b - 1, c), state(i - 1, a, b, c) + 1);
              }
              if (c + 1 <= k && a + b + c + 1 <= k && (!a || !b)) {
                cmax(state(i, a, b, c + 1), state(i - 1, a, b, c));
              }
            }
          }
        }
      }
      for (int a = 0; a <= k; ++a) {
        for (int b = 0; b <= k - a; ++b) {
          for (int c = 0; c <= k - a - b; ++c) {
            if (a && b && c) break;
            cmax(ans, state(i, a, b, c));
          }
        }
      }
    }
    cout << ans << endl;
  }
}