답안 #850881

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
850881	2023-09-17T16:06:14 Z	danikoynov	Chorus (JOI23_chorus)	C++14	40 / 100	7000 ms	199504 KB

chorus

/**
 ____ ____ ____ ____ ____ ____
||l |||e |||i |||n |||a |||d ||
||__|||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|/__\|

**/

#include<bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

const int maxn = 5100;
int n, k;
string s;

int dp[maxn][maxn], pos[2][maxn];
/**

*/

void chmin(int &var, int val) /// careful for long long
{
    var = min(var, val);
}

int cost[maxn][maxn];

void precalc()
{
    for (int j = 1; j <= n; j ++)
    {
        int tk = 0;
        for (int fix = 1; fix <= n - j; fix ++)
        {
                if (pos[0][fix + j] > j * 2 + fix)
                    tk += pos[0][fix + j] - (j * 2 + fix);
            cost[j][fix] = tk;
        }
    }
}
void solve()
{
    cin >> n >> k >> s;

    s = "#" + s;
    int cntA = 0, cntB = 0;
    for (int i = 1; i <= 2 * n; i ++)
    {
        if (s[i] == 'A')
        {
            cntA ++;
            pos[0][cntA] = i;
        }
        else
        {
            cntB ++;
            pos[1][cntB] = i;
        }
    }

    for (int i = 0; i <= n; i ++)
        for (int j = 0; j <= n; j ++)
        dp[i][j] = 4 * n * n; /// careful for overflow

 precalc();

        int cr = 0;
    for (int j = 1; j <= n; j ++)
    {
        cr = cr + pos[0][j] - j;

        dp[1][j] = cr;
    }

    for (int i = 1; i < k; i ++)
    {
        for (int j = 1; j <= n; j ++)
        {
            if (dp[i][j] == 4 * n * n)
                continue;

            for (int fix = 1; fix <= n - j; fix ++)
            {
                chmin(dp[i + 1][j + fix], dp[i][j] + cost[j][fix]);
            }



        }
    }

    int ans = 4 * n * n;
    for (int i = 1; i <= k; i ++)
        ans = min(ans, dp[i][n]);
    cout << ans << endl;
}

int main()
{
    ///freopen("test.txt", "r", stdin);
    solve();
    return 0;
}

Subtask #1

16.0 / 16.0

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

Subtask #2

24.0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2392 KB	Output is correct
3	Correct	1 ms	2392 KB	Output is correct
4	Correct	1 ms	4440 KB	Output is correct
5	Correct	1 ms	2592 KB	Output is correct
6	Correct	1 ms	2392 KB	Output is correct
7	Correct	1 ms	4440 KB	Output is correct
8	Correct	2 ms	4440 KB	Output is correct
9	Correct	1 ms	4440 KB	Output is correct
10	Correct	1 ms	4440 KB	Output is correct
11	Correct	1 ms	4440 KB	Output is correct
12	Correct	1 ms	4696 KB	Output is correct
13	Correct	1 ms	4440 KB	Output is correct
14	Correct	1 ms	4604 KB	Output is correct
15	Correct	1 ms	4440 KB	Output is correct
16	Correct	1 ms	4444 KB	Output is correct
17	Correct	2 ms	10584 KB	Output is correct
18	Correct	11 ms	22872 KB	Output is correct
19	Correct	18 ms	22872 KB	Output is correct
20	Correct	3 ms	22876 KB	Output is correct
21	Correct	3 ms	22872 KB	Output is correct
22	Correct	22 ms	22872 KB	Output is correct
23	Correct	23 ms	22872 KB	Output is correct
24	Correct	4 ms	22872 KB	Output is correct
25	Correct	21 ms	22872 KB	Output is correct
26	Correct	20 ms	22872 KB	Output is correct
27	Correct	15 ms	22872 KB	Output is correct
28	Correct	15 ms	22872 KB	Output is correct

Subtask #3

0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2392 KB	Output is correct
3	Correct	1 ms	2392 KB	Output is correct
4	Correct	1 ms	4440 KB	Output is correct
5	Correct	1 ms	2592 KB	Output is correct
6	Correct	1 ms	2392 KB	Output is correct
7	Correct	1 ms	4440 KB	Output is correct
8	Correct	2 ms	4440 KB	Output is correct
9	Correct	1 ms	4440 KB	Output is correct
10	Correct	1 ms	4440 KB	Output is correct
11	Correct	1 ms	4440 KB	Output is correct
12	Correct	1 ms	4696 KB	Output is correct
13	Correct	1 ms	4440 KB	Output is correct
14	Correct	1 ms	4604 KB	Output is correct
15	Correct	1 ms	4440 KB	Output is correct
16	Correct	1 ms	4444 KB	Output is correct
17	Correct	2 ms	10584 KB	Output is correct
18	Correct	11 ms	22872 KB	Output is correct
19	Correct	18 ms	22872 KB	Output is correct
20	Correct	3 ms	22876 KB	Output is correct
21	Correct	3 ms	22872 KB	Output is correct
22	Correct	22 ms	22872 KB	Output is correct
23	Correct	23 ms	22872 KB	Output is correct
24	Correct	4 ms	22872 KB	Output is correct
25	Correct	21 ms	22872 KB	Output is correct
26	Correct	20 ms	22872 KB	Output is correct
27	Correct	15 ms	22872 KB	Output is correct
28	Correct	15 ms	22872 KB	Output is correct
29	Execution timed out	7007 ms	199504 KB	Time limit exceeded
30	Halted	0 ms	0 KB	-

Subtask #4

0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2392 KB	Output is correct
3	Correct	1 ms	2392 KB	Output is correct
4	Correct	1 ms	4440 KB	Output is correct
5	Correct	1 ms	2592 KB	Output is correct
6	Correct	1 ms	2392 KB	Output is correct
7	Correct	1 ms	4440 KB	Output is correct
8	Correct	2 ms	4440 KB	Output is correct
9	Correct	1 ms	4440 KB	Output is correct
10	Correct	1 ms	4440 KB	Output is correct
11	Correct	1 ms	4440 KB	Output is correct
12	Correct	1 ms	4696 KB	Output is correct
13	Correct	1 ms	4440 KB	Output is correct
14	Correct	1 ms	4604 KB	Output is correct
15	Correct	1 ms	4440 KB	Output is correct
16	Correct	1 ms	4444 KB	Output is correct
17	Correct	2 ms	10584 KB	Output is correct
18	Correct	11 ms	22872 KB	Output is correct
19	Correct	18 ms	22872 KB	Output is correct
20	Correct	3 ms	22876 KB	Output is correct
21	Correct	3 ms	22872 KB	Output is correct
22	Correct	22 ms	22872 KB	Output is correct
23	Correct	23 ms	22872 KB	Output is correct
24	Correct	4 ms	22872 KB	Output is correct
25	Correct	21 ms	22872 KB	Output is correct
26	Correct	20 ms	22872 KB	Output is correct
27	Correct	15 ms	22872 KB	Output is correct
28	Correct	15 ms	22872 KB	Output is correct
29	Execution timed out	7007 ms	199504 KB	Time limit exceeded
30	Halted	0 ms	0 KB	-

Subtask #5

0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2392 KB	Output is correct
3	Correct	1 ms	2392 KB	Output is correct
4	Correct	1 ms	4440 KB	Output is correct
5	Correct	1 ms	2592 KB	Output is correct
6	Correct	1 ms	2392 KB	Output is correct
7	Correct	1 ms	4440 KB	Output is correct
8	Correct	2 ms	4440 KB	Output is correct
9	Correct	1 ms	4440 KB	Output is correct
10	Correct	1 ms	4440 KB	Output is correct
11	Correct	1 ms	4440 KB	Output is correct
12	Correct	1 ms	4696 KB	Output is correct
13	Correct	1 ms	4440 KB	Output is correct
14	Correct	1 ms	4604 KB	Output is correct
15	Correct	1 ms	4440 KB	Output is correct
16	Correct	1 ms	4444 KB	Output is correct
17	Correct	2 ms	10584 KB	Output is correct
18	Correct	11 ms	22872 KB	Output is correct
19	Correct	18 ms	22872 KB	Output is correct
20	Correct	3 ms	22876 KB	Output is correct
21	Correct	3 ms	22872 KB	Output is correct
22	Correct	22 ms	22872 KB	Output is correct
23	Correct	23 ms	22872 KB	Output is correct
24	Correct	4 ms	22872 KB	Output is correct
25	Correct	21 ms	22872 KB	Output is correct
26	Correct	20 ms	22872 KB	Output is correct
27	Correct	15 ms	22872 KB	Output is correct
28	Correct	15 ms	22872 KB	Output is correct
29	Execution timed out	7007 ms	199504 KB	Time limit exceeded
30	Halted	0 ms	0 KB	-