제출 #1148686

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1148686		AmirAli_H1	Chorus (JOI23_chorus)	C++20	40 / 100	7090 ms	580 KiB

chorus

// In the name of Allah

#include <bits/stdc++.h>
using namespace std;

typedef		long long int			ll;
typedef		long double				ld;
typedef		pair<int, int>			pii;
typedef		pair<ll, ll>			pll;
typedef		complex<ld>				cld;

#define		all(x)					(x).begin(),(x).end()
#define		len(x)					((ll) (x).size())
#define		F						first
#define		S						second
#define		pb						push_back
#define		sep						' '
#define		endl					'\n'
#define		Mp						make_pair
#define		kill(x)					cout << x << '\n', exit(0)
#define		set_dec(x)				cout << fixed << setprecision(x);
#define		file_io(x,y)			freopen(x, "r", stdin); freopen(y, "w", stdout);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int maxn = 5000 + 4;
const ll oo = 1e18 + 4;

int n, k; string s;
vector<ll> ls; ll dp[maxn];

void solve() {
	cin >> n >> k >> s;
	int x = 0;
	for (int i = 0; i < (2 * n); i++) {
		if (s[i] == 'B') x++;
		else ls.pb(x);
	}

	dp[0] = 0;
	for (int j = 1; j <= n; j++) dp[j] = oo;
	for (int i = 0; i < k; i++) {
		for (int j = n; j >= 0; j--) {
			if (dp[j] == oo) continue;
			ll x = 0;
			for (int R = j + 1; R <= n; R++) {
				x += max(0ll, (ls[R - 1] - j));
				dp[R] = min(dp[R], dp[j] + x);
			}
		}
	}
	cout << dp[n] << endl;
}

int main() {
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	
	int T = 1;
	while (T--) {
		solve();
	}
	
	return 0;
}

• Subtask 1: 16 / 16
• Subtask 2: 24 / 24
• Subtask 3: 0 / 21
• Subtask 4: 0 / 26
• Subtask 5: 0 / 13