Submission #767424

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
767424	2023-06-26T18:24:30 Z	PurpleCrayon	Chorus (JOI23_chorus)	C++17	16 / 100	45 ms	5396 KB

chorus

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

#define sz(v) int(v.size())
#define ar array
typedef long long ll;
const int N = 5e3+10, MOD = 1e9+7;

int n, K, small[N], cost[N][N];
int ps[N], l_use[N];
vector<int> one, two;
int dp[N][N];

void solve() {
    cin >> n >> K;
    for (int i = 0; i < 2 * n; i++) {
        char c; cin >> c;
        if (c == 'A') one.push_back(i);
        else two.push_back(i);
    }

    // for (int x : one) cerr << x << ' '; cerr << endl;
    // for (int x : two) cerr << x << ' '; cerr << endl;

    for (int i = 0; i < n; i++) {
        small[i] = lower_bound(two.begin(), two.end(), one[i]) - two.begin();
    }

    for (int i = 0; i < n; i++) {
        ps[i] = small[i] + (i ? ps[i-1] : 0);
        l_use[i] = -(i ? ps[i-1] : 0);
        for (int j = i; j < n; j++) {
            if (small[j] < i) {
                l_use[i] -= small[j] - i;
            }
        }
    }

    // -l * (r - l + 1) + ps_small[r] - other_ps_small[l-1]
    // other_ps_small[l-1] = (small[r] < l ?
    // for (int i = 0; i < n; i++) cerr << small[i] << ' ';
    // cerr << endl;

    for (int l = 0; l < n; l++) {
        int cur = 0;
        for (int r = l; r < n; r++) {
            cur += max(small[r] - l, 0);
            cost[l][r] = cur;
        }
    }
    
    auto COST = [&](int l, int r) {
        return ps[r] + l_use[l] - l * (r - l + 1);
    };

    for (int i = 0; i < n; i++) {
        for (int j = i; j < n; j++) {
            int one = cost[i][j];
            int two = COST(i, j);
            assert(one == 0 && two > 0 || one == two);
        }
    }

    for (int i = 0; i < n; i++) for (int j = 0; j <= K; j++) dp[i][j] = MOD;

    for (int i = 0; i < n; i++) {
        for (int k = 1; k <= K; k++) {
            for (int l = i; l >= 0; l--) {
                int prv = MOD;
                if (l == 0) prv = (k == 1 ? 0 : MOD);
                else prv = dp[l-1][k-1];

                dp[i][k] = min(dp[i][k], COST(l, i) + prv);
            }

            int l = small[i];
            if (l <= i) {
                int prv = MOD;
                if (l == 0) prv = (k == 1 ? 0 : MOD);
                else prv = dp[l-1][k-1];

                dp[i][k] = min(dp[i][k], prv + prv);
            }
        }
    }

    cout << dp[n-1][K] << '\n';
}

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

Compilation message

In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from chorus.cpp:1:
chorus.cpp: In function 'void solve()':
chorus.cpp:60:29: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   60 |             assert(one == 0 && two > 0 || one == two);
      |                    ~~~~~~~~~^~~~~~~~~~

Subtask #1
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	12 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct

Subtask #2
0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	12 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	2 ms	1876 KB	Output is correct
18	Correct	17 ms	5064 KB	Output is correct
19	Incorrect	45 ms	5396 KB	Output isn't correct
20	Halted	0 ms	0 KB	-

Subtask #3
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	12 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	2 ms	1876 KB	Output is correct
18	Correct	17 ms	5064 KB	Output is correct
19	Incorrect	45 ms	5396 KB	Output isn't correct
20	Halted	0 ms	0 KB	-

Subtask #4
0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	12 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	2 ms	1876 KB	Output is correct
18	Correct	17 ms	5064 KB	Output is correct
19	Incorrect	45 ms	5396 KB	Output isn't correct
20	Halted	0 ms	0 KB	-

Subtask #5
0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	12 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	2 ms	1876 KB	Output is correct
18	Correct	17 ms	5064 KB	Output is correct
19	Incorrect	45 ms	5396 KB	Output isn't correct
20	Halted	0 ms	0 KB	-

Submission #767424

Compilation message

Subtask #1 16.0 / 16.0

Subtask #2 0 / 24.0

Subtask #3 0 / 21.0

Subtask #4 0 / 26.0

Subtask #5 0 / 13.0

Subtask #1
16.0 / 16.0

Subtask #2
0 / 24.0

Subtask #3
0 / 21.0

Subtask #4
0 / 26.0

Subtask #5
0 / 13.0