답안 #767405

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
767405	2023-06-26T17:54:31 Z	PurpleCrayon	Chorus (JOI23_chorus)	C++17	40 / 100	7000 ms	125004 KB

chorus

#include <bits/stdc++.h>
using namespace std;

#define sz(v) int(v.size())
#define ar array
typedef long long ll;
const int N = 5e3+10, MOD = 1e9+7;

int n, K, small[N];
vector<int> one, two;
int dp[N][N], cost[N][N];

void solve() {
    cin >> n >> K;
    for (int i = 0; i < 2 * n; i++) {
        char c; cin >> c;
        if (c == 'A') one.push_back(i);
        else two.push_back(i);
    }

    // for (int x : one) cerr << x << ' '; cerr << endl;
    // for (int x : two) cerr << x << ' '; cerr << endl;

    for (int i = 0; i < n; i++) {
        small[i] = lower_bound(two.begin(), two.end(), one[i]) - two.begin();
    }

    for (int l = 0; l < n; l++) {
        int cur = 0;
        for (int r = l; r < n; r++) {
            cur += max(small[r] - l, 0);
            cost[l][r] = cur;
        }
    }

    for (int i = 0; i < n; i++) for (int j = 0; j <= K; j++) dp[i][j] = MOD;

    for (int i = 0; i < n; i++) {
        for (int l = i; l >= 0; l--) {
            for (int k = 1; k <= K; k++) {
                int prv = MOD;
                if (l == 0) prv = (k == 1 ? 0 : MOD);
                else prv = dp[l-1][k-1];

                dp[i][k] = min(dp[i][k], cost[l][i] + prv);
            }
        }
    }

    cout << dp[n-1][K] << '\n';
}

int main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int T = 1;
    // cin >> T;
    while (T--) solve();
}

Subtask #1

16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct

Subtask #2

24.0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	2 ms	1876 KB	Output is correct
18	Correct	19 ms	5048 KB	Output is correct
19	Correct	36 ms	5332 KB	Output is correct
20	Correct	2 ms	4820 KB	Output is correct
21	Correct	2 ms	4820 KB	Output is correct
22	Correct	63 ms	5844 KB	Output is correct
23	Correct	63 ms	5844 KB	Output is correct
24	Correct	4 ms	4820 KB	Output is correct
25	Correct	64 ms	5844 KB	Output is correct
26	Correct	53 ms	5588 KB	Output is correct
27	Correct	23 ms	5076 KB	Output is correct
28	Correct	23 ms	5076 KB	Output is correct

Subtask #3

0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	2 ms	1876 KB	Output is correct
18	Correct	19 ms	5048 KB	Output is correct
19	Correct	36 ms	5332 KB	Output is correct
20	Correct	2 ms	4820 KB	Output is correct
21	Correct	2 ms	4820 KB	Output is correct
22	Correct	63 ms	5844 KB	Output is correct
23	Correct	63 ms	5844 KB	Output is correct
24	Correct	4 ms	4820 KB	Output is correct
25	Correct	64 ms	5844 KB	Output is correct
26	Correct	53 ms	5588 KB	Output is correct
27	Correct	23 ms	5076 KB	Output is correct
28	Correct	23 ms	5076 KB	Output is correct
29	Execution timed out	7055 ms	125004 KB	Time limit exceeded
30	Halted	0 ms	0 KB	-

Subtask #4

0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	2 ms	1876 KB	Output is correct
18	Correct	19 ms	5048 KB	Output is correct
19	Correct	36 ms	5332 KB	Output is correct
20	Correct	2 ms	4820 KB	Output is correct
21	Correct	2 ms	4820 KB	Output is correct
22	Correct	63 ms	5844 KB	Output is correct
23	Correct	63 ms	5844 KB	Output is correct
24	Correct	4 ms	4820 KB	Output is correct
25	Correct	64 ms	5844 KB	Output is correct
26	Correct	53 ms	5588 KB	Output is correct
27	Correct	23 ms	5076 KB	Output is correct
28	Correct	23 ms	5076 KB	Output is correct
29	Execution timed out	7055 ms	125004 KB	Time limit exceeded
30	Halted	0 ms	0 KB	-

Subtask #5

0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	2 ms	1876 KB	Output is correct
18	Correct	19 ms	5048 KB	Output is correct
19	Correct	36 ms	5332 KB	Output is correct
20	Correct	2 ms	4820 KB	Output is correct
21	Correct	2 ms	4820 KB	Output is correct
22	Correct	63 ms	5844 KB	Output is correct
23	Correct	63 ms	5844 KB	Output is correct
24	Correct	4 ms	4820 KB	Output is correct
25	Correct	64 ms	5844 KB	Output is correct
26	Correct	53 ms	5588 KB	Output is correct
27	Correct	23 ms	5076 KB	Output is correct
28	Correct	23 ms	5076 KB	Output is correct
29	Execution timed out	7055 ms	125004 KB	Time limit exceeded
30	Halted	0 ms	0 KB	-