제출 #834701

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
834701		Antekb	Chorus (JOI23_chorus)	C++17	40 / 100	7008 ms	79304 KiB

chorus

#include<bits/stdc++.h>
#define st first
#define nd second
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define eb emplace_back
#define pp pop_back
#define mp make_pair
using namespace std;
using pii = pair<int, int>;
using ll = long long;
using vi = vector<int>;
using vii = vector<pii>;
void debug(){cerr<<"\n";}
template<typename H, typename... T>
void debug(H h, T... t){
	cerr<<h;
	if(sizeof...(t)){
		cerr<<", ";
	}
	debug(t...);
}
#define deb(x...) cerr<<#x<<" = ";debug(x);

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

int main(){
	int n, k;
	string s;
	cin>>n>>k>>s;
	vi V(n+1);
	int a=0, b=1;
	for(char c:s){
		if(c=='A')a++;
		else{
			V[b]=a;
			b++;
		}
	}
	vector<vector<ll> > dp(n+1, vector<ll>(k+1, 1e18));
	dp[0][0]=0;
	for(int kk=1; kk<=k; kk++){
		for(int i=kk; i<=n; i++){
			for(int j=0; j<i; j++){
				ll c=0;
				for(int l=j+1; l<=i; l++){
					c+=max(0, i-V[l]);
				}
				dp[i][kk]=min(dp[i][kk], dp[j][kk-1]+c);
			}
		}
	}
	cout<<dp[n][k];
}

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