Submission #746274

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
746274	2023-05-22T07:04:53 Z	baluteshih	Chorus (JOI23_chorus)	C++14	40 / 100	128 ms	2312 KB

chorus

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define SZ(a) ((int)a.size())
#define ALL(v) v.begin(), v.end()
#define pb push_back

int lft[1000005], lst[1000005];
ll prv[1000005];

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n, k;
    string s;
    cin >> n >> k >> s;
    if (n > 500) return 0;

    int cntA = 0, cntB = 0;
    for (int i = 0; i < n + n; ++i) {
        if (s[i] == 'B') ++cntB;
        else lft[++cntA] = cntB;
    }
    for (int i = 1; i <= n; ++i)
        prv[i] = prv[i - 1] + lft[i];
    for (int i = 0; i <= n; ++i)
        lst[lft[i]] = i;
    for (int i = 1; i <= n; ++i)
        lst[i] = max(lst[i], lst[i - 1]);
    for (int i = 0; i <= n; ++i)
        lst[i] = max(i, lst[i]);

    const ll INF = 1e18;
    vector<vector<ll>> dp(k + 1, vector<ll>(n + 1, INF));
    ll fin = INF;
    dp[0][0] = 0;
    for (int i = 1; i <= k; ++i) { 
        for (int j = 1, p = 0; j <= n; ++j) {
            while (lst[p] <= j && p < j) ++p;
            if (p < j) 
                dp[i][j] = min(dp[i][j], dp[i - 1][p]);
            for (int q = 0; q < p; ++q)
                dp[i][j] = min(dp[i][j], dp[i - 1][q] + prv[j] - prv[lst[q]] - q * (j - lst[q]));
        }
        fin = min(fin, dp[i][n]);
    }

    cout << fin << "\n";
}

Subtask #1

16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	340 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	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	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct

Subtask #2

24.0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	340 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	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	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	2 ms	340 KB	Output is correct
18	Correct	21 ms	596 KB	Output is correct
19	Correct	65 ms	1364 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	105 ms	2308 KB	Output is correct
23	Correct	105 ms	2312 KB	Output is correct
24	Correct	3 ms	340 KB	Output is correct
25	Correct	128 ms	2304 KB	Output is correct
26	Correct	86 ms	1876 KB	Output is correct
27	Correct	36 ms	980 KB	Output is correct
28	Correct	35 ms	980 KB	Output is correct

Subtask #3

0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	340 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	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	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	2 ms	340 KB	Output is correct
18	Correct	21 ms	596 KB	Output is correct
19	Correct	65 ms	1364 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	105 ms	2308 KB	Output is correct
23	Correct	105 ms	2312 KB	Output is correct
24	Correct	3 ms	340 KB	Output is correct
25	Correct	128 ms	2304 KB	Output is correct
26	Correct	86 ms	1876 KB	Output is correct
27	Correct	36 ms	980 KB	Output is correct
28	Correct	35 ms	980 KB	Output is correct
29	Incorrect	0 ms	340 KB	Output isn't correct
30	Halted	0 ms	0 KB	-

Subtask #4

0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	340 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	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	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	2 ms	340 KB	Output is correct
18	Correct	21 ms	596 KB	Output is correct
19	Correct	65 ms	1364 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	105 ms	2308 KB	Output is correct
23	Correct	105 ms	2312 KB	Output is correct
24	Correct	3 ms	340 KB	Output is correct
25	Correct	128 ms	2304 KB	Output is correct
26	Correct	86 ms	1876 KB	Output is correct
27	Correct	36 ms	980 KB	Output is correct
28	Correct	35 ms	980 KB	Output is correct
29	Incorrect	0 ms	340 KB	Output isn't correct
30	Halted	0 ms	0 KB	-

Subtask #5

0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	340 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	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	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	2 ms	340 KB	Output is correct
18	Correct	21 ms	596 KB	Output is correct
19	Correct	65 ms	1364 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	105 ms	2308 KB	Output is correct
23	Correct	105 ms	2312 KB	Output is correct
24	Correct	3 ms	340 KB	Output is correct
25	Correct	128 ms	2304 KB	Output is correct
26	Correct	86 ms	1876 KB	Output is correct
27	Correct	36 ms	980 KB	Output is correct
28	Correct	35 ms	980 KB	Output is correct
29	Incorrect	0 ms	340 KB	Output isn't correct
30	Halted	0 ms	0 KB	-