oj.uz

답안 #1090871

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1090871 2024-09-19T01:33:57 Z eltu0815 Chorus (JOI23_chorus) C++14
16 / 100
 60 ms 3420 KB 
#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;

int 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;
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 464 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 504 KB Output is correct

Subtask #2
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 464 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 504 KB Output is correct
17 Correct 2 ms 1116 KB Output is correct
18 Correct 20 ms 2648 KB Output is correct
19 Incorrect 60 ms 3420 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 464 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 504 KB Output is correct
17 Correct 2 ms 1116 KB Output is correct
18 Correct 20 ms 2648 KB Output is correct
19 Incorrect 60 ms 3420 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 464 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 504 KB Output is correct
17 Correct 2 ms 1116 KB Output is correct
18 Correct 20 ms 2648 KB Output is correct
19 Incorrect 60 ms 3420 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 464 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 504 KB Output is correct
17 Correct 2 ms 1116 KB Output is correct
18 Correct 20 ms 2648 KB Output is correct
19 Incorrect 60 ms 3420 KB Output isn't correct
20 Halted 0 ms 0 KB -