oj.uz

Submission #796381

# Submission time Handle Problem Language Result Execution time Memory
796381 2023-07-28T10:44:36 Z Johann Chorus (JOI23_chorus) C++14
40 / 100
 7000 ms 79436 KB 
#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;

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;
    }

    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 = 1; k < K; ++k)
    {
        // compute k + 1 with k and iterative approach
        for (int i = k; i <= N; ++i)
        {
            // working from base i times 0 and i times 1;
            ll tmp = dp[i][k];
            int border = 2 * i;
            for (int j = i; j < N; ++j)
            {
                if (pos[0][j] < border)
                    ++border;
                else
                    tmp += pos[0][j] - border++;
                dp[j + 1][k + 1] = min(dp[j + 1][k + 1], tmp);
            }
        }
    }

    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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 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 0 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 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 0 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 16 ms 596 KB Output is correct
19 Correct 29 ms 1364 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 32 ms 2324 KB Output is correct
23 Correct 33 ms 2260 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 32 ms 2320 KB Output is correct
26 Correct 31 ms 1876 KB Output is correct
27 Correct 22 ms 1012 KB Output is correct
28 Correct 22 ms 1012 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 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 0 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 16 ms 596 KB Output is correct
19 Correct 29 ms 1364 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 32 ms 2324 KB Output is correct
23 Correct 33 ms 2260 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 32 ms 2320 KB Output is correct
26 Correct 31 ms 1876 KB Output is correct
27 Correct 22 ms 1012 KB Output is correct
28 Correct 22 ms 1012 KB Output is correct
29 Execution timed out 7087 ms 79436 KB Time limit exceeded
30 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 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 0 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 16 ms 596 KB Output is correct
19 Correct 29 ms 1364 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 32 ms 2324 KB Output is correct
23 Correct 33 ms 2260 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 32 ms 2320 KB Output is correct
26 Correct 31 ms 1876 KB Output is correct
27 Correct 22 ms 1012 KB Output is correct
28 Correct 22 ms 1012 KB Output is correct
29 Execution timed out 7087 ms 79436 KB Time limit exceeded
30 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 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 0 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 16 ms 596 KB Output is correct
19 Correct 29 ms 1364 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 32 ms 2324 KB Output is correct
23 Correct 33 ms 2260 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 32 ms 2320 KB Output is correct
26 Correct 31 ms 1876 KB Output is correct
27 Correct 22 ms 1012 KB Output is correct
28 Correct 22 ms 1012 KB Output is correct
29 Execution timed out 7087 ms 79436 KB Time limit exceeded
30 Halted 0 ms 0 KB -