| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1090872 | eltu0815 | Chorus (JOI23_chorus) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define MAX 300005
#define MOD (ll)(1048573)
#define INF (ll)(1e18)
#define inf (int)(1e9)
#define eps (double)(1e-8)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int tt, n, m, k, q;
string str;
ll cnt[MAX], sum[MAX], pos[MAX];
ll dp[5005][5005];
ll cost(int i, int j) {
ll ret = 0;
for(int k = i; k <= j; ++k) {
ret += max(0, - (i - 1) + cnt[k]);
}
return ret;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
cin >> n >> k >> str;
for(int i = 0, tmp = 0, p = 0; i < 2 * n; ++i) {
if(str[i] == 'A') cnt[++p] = tmp;
else ++tmp;
}
for(int i = 0, j = 1; i <= n; ++i) {
while(j <= n && cnt[j] < i) ++j;
pos[i] = max(i + 1, j);
}
for(int i = 1; i <= n; ++i) sum[i] = sum[i - 1] + cnt[i];
for(int i = 0; i <= n; ++i) for(int j = 0; j <= k; ++j) dp[i][j] = INF;
dp[0][0] = 0;
for(int i = 1; i <= n; ++i) for(int j = 1; j <= k; ++j) {
for(int ii = 0; ii < i; ++ii) {
//if(pos[ii] <= i)
dp[i][j] = min(dp[i][j], dp[ii][j - 1] + sum[i] - sum[pos[ii] - 1] - (i - pos[ii] + 1) * ii);
//else dp[i][j] = min(dp[i][j], dp[ii][j - 1]);
}
}
cout << dp[n][k];
return 0;
}