Submission #796424

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
796424	2023-07-28T11:30:14 Z	Johann	Chorus (JOI23_chorus)	C++14	40 / 100	7000 ms	392380 KB

chorus

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

typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()

const ll INF = 1LL << 60;
int N, K;
vi S;
int cnt[2];
vi pos[2];
vvi dp;
vvi trans;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    cin >> N >> K;
    string SS;
    cin >> SS;
    S.resize(2 * N);
    for (int foo = 0; foo < 2; ++foo)
        pos[foo].assign(N, -1);
    for (int i = 0; i < 2 * N; ++i)
    {
        S[i] = (SS[i] == 'B');
        pos[S[i]][cnt[S[i]]++] = i;
    }

    trans = vvi(N + 1, vi(N + 1, INF));
    for (int i = 1; i <= N; ++i)
    {
        trans[i][i] = 0;
        int border = 2 * i;
        for (int j = i; j < N; ++j)
            trans[i][j + 1] = trans[i][j] + max(0LL, pos[0][j] - border++);
    }

    dp = vvi(N + 1, vi(K + 1, INF));

    dp[0][0] = 0;
    dp[0][1] = 0;
    for (int i = 0; i < N; ++i)
        dp[i + 1][1] = dp[i][1] + pos[0][i] - i;

    for (int k = 2; k <= K; ++k)
    {
        int idx = k - 1;
        for (int j = k; j <= N; ++j)
        {
            for (int i = idx; i < j; ++i)
                if (dp[i][k - 1] + trans[i][j] <= dp[idx][k - 1] + trans[idx][j])
                    idx = i;
            // while (idx + 1 < j && dp[idx][k - 1] + trans[idx][j] >= dp[idx + 1][k - 1] + trans[idx + 1][j])
            // ++idx;

            dp[j][k] = dp[idx][k - 1] + trans[idx][j];
        }
    }

    cout << dp[N][K] << endl;

    return 0;
}

Subtask #1
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct

Subtask #2
24.0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	596 KB	Output is correct
18	Correct	2 ms	2644 KB	Output is correct
19	Correct	3 ms	3284 KB	Output is correct
20	Correct	2 ms	2260 KB	Output is correct
21	Correct	1 ms	2260 KB	Output is correct
22	Correct	3 ms	4180 KB	Output is correct
23	Correct	3 ms	4180 KB	Output is correct
24	Correct	1 ms	2260 KB	Output is correct
25	Correct	3 ms	4180 KB	Output is correct
26	Correct	3 ms	3924 KB	Output is correct
27	Correct	2 ms	2900 KB	Output is correct
28	Correct	2 ms	2912 KB	Output is correct

Subtask #3
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	596 KB	Output is correct
18	Correct	2 ms	2644 KB	Output is correct
19	Correct	3 ms	3284 KB	Output is correct
20	Correct	2 ms	2260 KB	Output is correct
21	Correct	1 ms	2260 KB	Output is correct
22	Correct	3 ms	4180 KB	Output is correct
23	Correct	3 ms	4180 KB	Output is correct
24	Correct	1 ms	2260 KB	Output is correct
25	Correct	3 ms	4180 KB	Output is correct
26	Correct	3 ms	3924 KB	Output is correct
27	Correct	2 ms	2900 KB	Output is correct
28	Correct	2 ms	2912 KB	Output is correct
29	Correct	526 ms	269096 KB	Output is correct
30	Correct	676 ms	366236 KB	Output is correct
31	Correct	418 ms	236948 KB	Output is correct
32	Correct	79 ms	196684 KB	Output is correct
33	Correct	111 ms	196664 KB	Output is correct
34	Correct	663 ms	392380 KB	Output is correct
35	Correct	639 ms	392328 KB	Output is correct
36	Correct	189 ms	196996 KB	Output is correct
37	Correct	428 ms	235752 KB	Output is correct
38	Correct	670 ms	358644 KB	Output is correct
39	Correct	541 ms	289748 KB	Output is correct
40	Correct	485 ms	261884 KB	Output is correct
41	Correct	500 ms	261836 KB	Output is correct
42	Execution timed out	7031 ms	261840 KB	Time limit exceeded
43	Halted	0 ms	0 KB	-

Subtask #4
0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	596 KB	Output is correct
18	Correct	2 ms	2644 KB	Output is correct
19	Correct	3 ms	3284 KB	Output is correct
20	Correct	2 ms	2260 KB	Output is correct
21	Correct	1 ms	2260 KB	Output is correct
22	Correct	3 ms	4180 KB	Output is correct
23	Correct	3 ms	4180 KB	Output is correct
24	Correct	1 ms	2260 KB	Output is correct
25	Correct	3 ms	4180 KB	Output is correct
26	Correct	3 ms	3924 KB	Output is correct
27	Correct	2 ms	2900 KB	Output is correct
28	Correct	2 ms	2912 KB	Output is correct
29	Correct	526 ms	269096 KB	Output is correct
30	Correct	676 ms	366236 KB	Output is correct
31	Correct	418 ms	236948 KB	Output is correct
32	Correct	79 ms	196684 KB	Output is correct
33	Correct	111 ms	196664 KB	Output is correct
34	Correct	663 ms	392380 KB	Output is correct
35	Correct	639 ms	392328 KB	Output is correct
36	Correct	189 ms	196996 KB	Output is correct
37	Correct	428 ms	235752 KB	Output is correct
38	Correct	670 ms	358644 KB	Output is correct
39	Correct	541 ms	289748 KB	Output is correct
40	Correct	485 ms	261884 KB	Output is correct
41	Correct	500 ms	261836 KB	Output is correct
42	Execution timed out	7031 ms	261840 KB	Time limit exceeded
43	Halted	0 ms	0 KB	-

Subtask #5
0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	596 KB	Output is correct
18	Correct	2 ms	2644 KB	Output is correct
19	Correct	3 ms	3284 KB	Output is correct
20	Correct	2 ms	2260 KB	Output is correct
21	Correct	1 ms	2260 KB	Output is correct
22	Correct	3 ms	4180 KB	Output is correct
23	Correct	3 ms	4180 KB	Output is correct
24	Correct	1 ms	2260 KB	Output is correct
25	Correct	3 ms	4180 KB	Output is correct
26	Correct	3 ms	3924 KB	Output is correct
27	Correct	2 ms	2900 KB	Output is correct
28	Correct	2 ms	2912 KB	Output is correct
29	Correct	526 ms	269096 KB	Output is correct
30	Correct	676 ms	366236 KB	Output is correct
31	Correct	418 ms	236948 KB	Output is correct
32	Correct	79 ms	196684 KB	Output is correct
33	Correct	111 ms	196664 KB	Output is correct
34	Correct	663 ms	392380 KB	Output is correct
35	Correct	639 ms	392328 KB	Output is correct
36	Correct	189 ms	196996 KB	Output is correct
37	Correct	428 ms	235752 KB	Output is correct
38	Correct	670 ms	358644 KB	Output is correct
39	Correct	541 ms	289748 KB	Output is correct
40	Correct	485 ms	261884 KB	Output is correct
41	Correct	500 ms	261836 KB	Output is correct
42	Execution timed out	7031 ms	261840 KB	Time limit exceeded
43	Halted	0 ms	0 KB	-

Submission #796424

Compilation message

Subtask #1 16.0 / 16.0

Subtask #2 24.0 / 24.0

Subtask #3 0 / 21.0

Subtask #4 0 / 26.0

Subtask #5 0 / 13.0

Subtask #1
16.0 / 16.0

Subtask #2
24.0 / 24.0

Subtask #3
0 / 21.0

Subtask #4
0 / 26.0

Subtask #5
0 / 13.0