Submission #767393

#	Time	Username	Problem	Language	Result	Execution time	Memory
767393		PurpleCrayon	Chorus (JOI23_chorus)	C++17	40 / 100	7029 ms	5828 KiB

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;
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 l = 0; l < n; l++) {
        for (int r = l; r < n; r++) {
            for (int i = l; i <= r; i++) {
                for (int j = l; j < n; j++) {
                    cost[l][r] += one[i] > two[j];
                }
            }
        }
    }

    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 / 16
• Subtask 2: 24 / 24
• Subtask 3: 0 / 21
• Subtask 4: 0 / 26
• Subtask 5: 0 / 13