# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
935046 | kim | Chorus (JOI23_chorus) | C++17 | 7019 ms | 144360 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>
using namespace std;
using ll=long long;
const ll inf=1e18;
int a[5005],b[5005],pos[5005];
ll dp[5005][5005],cost[5005][5005];
int main(){
ios::sync_with_stdio(false); cin.tie(0);
int n,K; cin>>n>>K;
string s; cin>>s;
for(int i=0,ia=0,ib=0;i<s.length();++i){
if(s[i]=='A') a[++ia]=i;
else b[++ib]=i;
}
for(int i=1,j=1;i<=n;++i){
while(j<=n&&b[j]<a[i]) ++j;
pos[i]=j;
}
for(int i=1;i<=n;++i){
for(int j=i;j<=n;++j){
cost[i][j]=cost[i][j-1]+max(0,pos[j]-i);
}
}
for(int i=1;i<=n;++i) dp[1][i]=cost[1][i];
for(int k=2;k<=K;++k){
for(int i=k;i<=n;++i){
dp[k][i]=inf;
for(int j=k-1;j<i;++j){
dp[k][i]=min(dp[k][i],dp[k-1][j]+cost[j+1][i]);
}
}
}
cout<<dp[K][n];
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |