# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
741746 | Username4132 | Chorus (JOI23_chorus) | C++14 | 7048 ms | 81396 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<iostream>
#include<vector>
using namespace std;
#define forn(i, n) for(int i=0; i<(int)n; ++i)
#define dforn(i, n) for(int i=0; i<(int)n; ++i)
#define forsn(i, s, n) for(int i=s; i<(int)n; ++i)
#define PB push_back
const int MAXN=5010, INF=1e7;
int n, K, pos[MAXN], cost[MAXN][MAXN], dp[MAXN][MAXN];
char str[MAXN];
vector<bool> imp;
int main(){
scanf("%d %d", &n, &K);
scanf("%s", str);
forn(i, n){
int cnA=0, cnB=0, cn=0;
forn(j, 2*n){
if(str[j]=='A'){
cnA++;
if(cnA>i) imp.PB(0);
}
else{
cnB++;
if(cnB>i) imp.PB(1);
}
}
forn(j, 2*(n-i)) if(!imp[j]) pos[cn++]=j;
forsn(j, 1, cn+1) cost[i][j]=cost[i][j-1]+pos[j-1]-j+1;
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... |