Submission #882545

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
882545	2023-12-03T10:53:21 Z	MilosMilutinovic	Chorus (JOI23_chorus)	C++14	16 / 100	7000 ms	600 KB

chorus

#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  string s;
  cin >> s;
  vector<int> a, b;
  for (int i = 0; i < 2 * n; i++) {
    if (s[i] == 'A') {
      a.push_back(i);
    } else {
      b.push_back(i);
    }
  }
  vector<int> pref(2 * n);
  for (int i = 0; i < 2 * n; i++) {
    if (i > 0) {
      pref[i] = pref[i - 1];
    }
    pref[i] += (s[i] == 'A' ? 1 : 0);
  }
  auto Get = [&](int L, int R) {
    return pref[R] - (L == 0 ? 0 : pref[L - 1]);
  };
  auto Solve = [&](int L, int R) {
    int res = 0;
    for (int i = L; i <= R; i++) {
      if (b[i] < a[R]) {
        res += Get(b[i], a[R]);
      }
    }
    return res;
  }; 
  const int inf = (int) 1e9;
  vector<int> dp(n + 1, inf);
  dp[0] = 0;
  for (int foo = 0; foo < k; foo++) {
    vector<int> new_dp(n + 1, inf);
    for (int i = 0; i < n; i++) {
      for (int j = i; j < n; j++) {
        new_dp[j + 1] = min(new_dp[j + 1], dp[i] + Solve(i, j));
      }
    }
    swap(dp, new_dp);
  }
  cout << dp[n] << '\n';
  return 0;
}

Subtask #1

16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 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	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	600 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct

Subtask #2

0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 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	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	600 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	69 ms	500 KB	Output is correct
18	Correct	1836 ms	448 KB	Output is correct
19	Correct	5560 ms	448 KB	Output is correct
20	Correct	23 ms	472 KB	Output is correct
21	Correct	37 ms	348 KB	Output is correct
22	Execution timed out	7078 ms	344 KB	Time limit exceeded
23	Halted	0 ms	0 KB	-

Subtask #3

0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 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	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	600 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	69 ms	500 KB	Output is correct
18	Correct	1836 ms	448 KB	Output is correct
19	Correct	5560 ms	448 KB	Output is correct
20	Correct	23 ms	472 KB	Output is correct
21	Correct	37 ms	348 KB	Output is correct
22	Execution timed out	7078 ms	344 KB	Time limit exceeded
23	Halted	0 ms	0 KB	-

Subtask #4

0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 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	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	600 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	69 ms	500 KB	Output is correct
18	Correct	1836 ms	448 KB	Output is correct
19	Correct	5560 ms	448 KB	Output is correct
20	Correct	23 ms	472 KB	Output is correct
21	Correct	37 ms	348 KB	Output is correct
22	Execution timed out	7078 ms	344 KB	Time limit exceeded
23	Halted	0 ms	0 KB	-

Subtask #5

0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 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	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	600 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	69 ms	500 KB	Output is correct
18	Correct	1836 ms	448 KB	Output is correct
19	Correct	5560 ms	448 KB	Output is correct
20	Correct	23 ms	472 KB	Output is correct
21	Correct	37 ms	348 KB	Output is correct
22	Execution timed out	7078 ms	344 KB	Time limit exceeded
23	Halted	0 ms	0 KB	-