Submission #767523

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
767523	2023-06-26T19:59:22 Z	PurpleCrayon	Chorus (JOI23_chorus)	C++17	61 / 100	426 ms	1996 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];
int ps[N], l_use[N];
vector<int> one, two;
 
// min CHT with
//  - slopes decreasing
//  - query x increasing
 
 
struct Line {
    int m, b;
    int calc(int x) {
        return m * x + b;
    }
};
 
struct CHT {
    deque<Line> lines;
 
    void add(int m, int b) {
        while (sz(lines) >= 2) {
            auto A = lines.end()[-2];
            auto B = lines.end()[-1];

            if ((b - A.b) * (A.m - B.m) <= (B.b - A.b) * (A.m - m)) lines.pop_back();
            else break;
        }
        lines.push_back({m, b});
    }
 
    int qry(int x) {
        while (sz(lines) >= 2 && lines[0].calc(x) >= lines[1].calc(x)) {
            lines.pop_front();
        }
 
        return lines[0].calc(x);
    }
};
 
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 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;
            }
        }
    }
 
    vector<int> prv(n, MOD);
    for (int k = 1; k <= K; k++) {
        vector<int> nxt(n, MOD);
 
        CHT lines;
        for (int i = 0; i < n; i++) {
            lines.add(-i, i * i - i + l_use[i] + (i == 0 ? 0 : prv[i-1]));
            nxt[i] = lines.qry(i) + ps[i];
 
            int l = small[i];
            if (l <= i) {
                nxt[i] = min(nxt[i], (l == 0 ? 0 : prv[l-1]));
            }
        }
        swap(prv, nxt);
    }
 
    cout << prv[n-1] << '\n';
}
 
int main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int T = 1;
    // cin >> T;
    while (T--) solve();
}

Subtask #1
16.0 / 16.0

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

Subtask #2
24.0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	2 ms	340 KB	Output is correct
19	Correct	3 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	3 ms	340 KB	Output is correct
23	Correct	3 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	3 ms	340 KB	Output is correct
26	Correct	3 ms	340 KB	Output is correct
27	Correct	2 ms	212 KB	Output is correct
28	Correct	2 ms	212 KB	Output is correct

Subtask #3
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	2 ms	340 KB	Output is correct
19	Correct	3 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	3 ms	340 KB	Output is correct
23	Correct	3 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	3 ms	340 KB	Output is correct
26	Correct	3 ms	340 KB	Output is correct
27	Correct	2 ms	212 KB	Output is correct
28	Correct	2 ms	212 KB	Output is correct
29	Correct	125 ms	468 KB	Output is correct
30	Correct	426 ms	488 KB	Output is correct
31	Correct	111 ms	492 KB	Output is correct
32	Correct	10 ms	584 KB	Output is correct
33	Correct	9 ms	448 KB	Output is correct
34	Correct	269 ms	512 KB	Output is correct
35	Correct	253 ms	504 KB	Output is correct
36	Correct	10 ms	456 KB	Output is correct
37	Correct	99 ms	504 KB	Output is correct
38	Correct	225 ms	468 KB	Output is correct
39	Correct	169 ms	468 KB	Output is correct
40	Correct	103 ms	488 KB	Output is correct
41	Correct	105 ms	484 KB	Output is correct
42	Correct	98 ms	456 KB	Output is correct

Subtask #4
0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	2 ms	340 KB	Output is correct
19	Correct	3 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	3 ms	340 KB	Output is correct
23	Correct	3 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	3 ms	340 KB	Output is correct
26	Correct	3 ms	340 KB	Output is correct
27	Correct	2 ms	212 KB	Output is correct
28	Correct	2 ms	212 KB	Output is correct
29	Correct	125 ms	468 KB	Output is correct
30	Correct	426 ms	488 KB	Output is correct
31	Correct	111 ms	492 KB	Output is correct
32	Correct	10 ms	584 KB	Output is correct
33	Correct	9 ms	448 KB	Output is correct
34	Correct	269 ms	512 KB	Output is correct
35	Correct	253 ms	504 KB	Output is correct
36	Correct	10 ms	456 KB	Output is correct
37	Correct	99 ms	504 KB	Output is correct
38	Correct	225 ms	468 KB	Output is correct
39	Correct	169 ms	468 KB	Output is correct
40	Correct	103 ms	488 KB	Output is correct
41	Correct	105 ms	484 KB	Output is correct
42	Correct	98 ms	456 KB	Output is correct
43	Runtime error	4 ms	1996 KB	Execution killed with signal 11
44	Halted	0 ms	0 KB	-

Subtask #5
0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	2 ms	340 KB	Output is correct
19	Correct	3 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	3 ms	340 KB	Output is correct
23	Correct	3 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	3 ms	340 KB	Output is correct
26	Correct	3 ms	340 KB	Output is correct
27	Correct	2 ms	212 KB	Output is correct
28	Correct	2 ms	212 KB	Output is correct
29	Correct	125 ms	468 KB	Output is correct
30	Correct	426 ms	488 KB	Output is correct
31	Correct	111 ms	492 KB	Output is correct
32	Correct	10 ms	584 KB	Output is correct
33	Correct	9 ms	448 KB	Output is correct
34	Correct	269 ms	512 KB	Output is correct
35	Correct	253 ms	504 KB	Output is correct
36	Correct	10 ms	456 KB	Output is correct
37	Correct	99 ms	504 KB	Output is correct
38	Correct	225 ms	468 KB	Output is correct
39	Correct	169 ms	468 KB	Output is correct
40	Correct	103 ms	488 KB	Output is correct
41	Correct	105 ms	484 KB	Output is correct
42	Correct	98 ms	456 KB	Output is correct
43	Runtime error	4 ms	1996 KB	Execution killed with signal 11
44	Halted	0 ms	0 KB	-

Submission #767523

Compilation message

Subtask #1 16.0 / 16.0

Subtask #2 24.0 / 24.0

Subtask #3 21.0 / 21.0

Subtask #4 0 / 26.0

Subtask #5 0 / 13.0

Subtask #1
16.0 / 16.0

Subtask #2
24.0 / 24.0

Subtask #3
21.0 / 21.0

Subtask #4
0 / 26.0

Subtask #5
0 / 13.0