답안 #932859

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
932859	2024-02-24T10:19:08 Z	alextodoran	Chorus (JOI23_chorus)	C++17	87 / 100	7000 ms	76632 KB

chorus

/**
 _  _   __  _ _ _  _  _ _
 |a  ||t  ||o    d | |o  |
| __    _| | _ | __|  _ |
| __ |/_  | __  /__\ / _\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;

const int N_MAX = 2000000;
const ll INF = LLONG_MAX;
const ld EPS = 1e-9;

int N, K;
int A[N_MAX + 2];
ll suff[N_MAX + 2];

ld dp[N_MAX + 2];
int cnt[N_MAX + 2];

struct Line {
    ld a, b;
    ld f (int x) {
        return a * x + b;
    }
};

Line lines[N_MAX + 2];
deque <int> rel;

bool check (const Line &l1, const Line &l2, const Line &l3) {
    return (l2.b - l1.b) * (l2.a - l3.a) < (l3.b - l2.b) * (l1.a - l2.a);
}

void add_line (int j) {
    while ((int) rel.size() >= 2
           && check(lines[rel.end()[-2]], lines[rel.back()], lines[j]) == false) {
        rel.pop_back();
    }
    rel.push_back(j);
}

pair <ld, int> query (int i) {
    if (rel.empty() == true) {
        return make_pair(INF, 0);
    }
    while ((int) rel.size() >= 2
           && make_pair(lines[rel[0]].f(i), cnt[rel[0]]) >=
              make_pair(lines[rel[1]].f(i), cnt[rel[1]])) {
        rel.pop_front();
    }
    return make_pair(lines[rel.front()].f(i) - suff[i + 1], cnt[rel.front()]);
}

ll solve (ld pen) {
    rel.clear();
    deque <int> dq;
    int curr = 0;
    for (int i = 1; i <= N; i++) {
        for (int j = curr; j < min(A[i] - i, i); j++) {
            // dp[j] + sum(A[i1] + i1 - j | i <= i1 <= i2)
            // dp[j] + suff[i] - suff[i2 + 1] - j * i2 + j * (i - 1)
            lines[j].a = -j;
            lines[j].b = dp[j] + suff[i] + (ll) j * (i - 1);
            add_line(j);
        }
        curr = min(A[i] - i, i);
        while (dq.empty() == false && dp[i - 1] < dp[dq.back()]) {
            dq.pop_back();
        }
        dq.push_back(i - 1);
        while (dq.empty() == false && dq.front() < curr) {
            dq.pop_front();
        }
        tie(dp[i], cnt[i]) = query(i);
        if (dq.empty() == false) {
            int j = dq.front();
            if (make_pair(dp[j], cnt[j]) < make_pair(dp[i], cnt[i])) {
                dp[i] = dp[j]; cnt[i] = cnt[j];
            }
        }
        dp[i] += pen; cnt[i]++;
    }
    return (ll) round(dp[N] - pen * K);
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(2);
    mt19937 rnd(time(0));

    cin >> N >> K;
//    N = 20; K = rnd() % N + 1;
    string S;
    cin >> S;
//    for (int i = 0; i < N * 2; i++) {
//        S += (i < N ? 'A' : 'B');
//    }
//    shuffle(S.begin(), S.end(), rnd);
//    cerr << N << " " << K << "\n";
//    cerr << S << "\n";
    for (int i = 0, j = 0; i < N * 2; i++) {
        if (S[i] == 'A') {
            A[++j] = i + 1;
        }
    }
    for (int i = N; i >= 1; i--) {
        suff[i] = suff[i + 1] + A[i] - i;
    }
    ld l = 0, r = LLONG_MAX; int iter = 110;
    while (iter--) {
        ld mid = (l + r) / 2;
        solve(mid);
        if (cnt[N] <= K) {
            r = mid;
        } else {
            l = mid + EPS;
        }
    }
    cout << solve(l) << "\n";

    return 0;
}

Subtask #1
16.0 / 16.0

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

Subtask #2
24.0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	6488 KB	Output is correct
3	Correct	1 ms	2508 KB	Output is correct
4	Correct	1 ms	6492 KB	Output is correct
5	Correct	1 ms	456 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	6492 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	2 ms	344 KB	Output is correct
18	Correct	3 ms	348 KB	Output is correct
19	Correct	4 ms	6492 KB	Output is correct
20	Correct	5 ms	2396 KB	Output is correct
21	Correct	3 ms	344 KB	Output is correct
22	Correct	3 ms	460 KB	Output is correct
23	Correct	3 ms	348 KB	Output is correct
24	Correct	4 ms	464 KB	Output is correct
25	Correct	5 ms	348 KB	Output is correct
26	Correct	3 ms	348 KB	Output is correct
27	Correct	3 ms	348 KB	Output is correct
28	Correct	5 ms	344 KB	Output is correct

Subtask #3
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	6488 KB	Output is correct
3	Correct	1 ms	2508 KB	Output is correct
4	Correct	1 ms	6492 KB	Output is correct
5	Correct	1 ms	456 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	6492 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	2 ms	344 KB	Output is correct
18	Correct	3 ms	348 KB	Output is correct
19	Correct	4 ms	6492 KB	Output is correct
20	Correct	5 ms	2396 KB	Output is correct
21	Correct	3 ms	344 KB	Output is correct
22	Correct	3 ms	460 KB	Output is correct
23	Correct	3 ms	348 KB	Output is correct
24	Correct	4 ms	464 KB	Output is correct
25	Correct	5 ms	348 KB	Output is correct
26	Correct	3 ms	348 KB	Output is correct
27	Correct	3 ms	348 KB	Output is correct
28	Correct	5 ms	344 KB	Output is correct
29	Correct	27 ms	604 KB	Output is correct
30	Correct	38 ms	6832 KB	Output is correct
31	Correct	34 ms	6748 KB	Output is correct
32	Correct	34 ms	604 KB	Output is correct
33	Correct	29 ms	600 KB	Output is correct
34	Correct	27 ms	848 KB	Output is correct
35	Correct	23 ms	604 KB	Output is correct
36	Correct	52 ms	604 KB	Output is correct
37	Correct	38 ms	6744 KB	Output is correct
38	Correct	27 ms	6696 KB	Output is correct
39	Correct	32 ms	816 KB	Output is correct
40	Correct	27 ms	600 KB	Output is correct
41	Correct	46 ms	604 KB	Output is correct
42	Correct	17 ms	600 KB	Output is correct

Subtask #4
26.0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	6488 KB	Output is correct
3	Correct	1 ms	2508 KB	Output is correct
4	Correct	1 ms	6492 KB	Output is correct
5	Correct	1 ms	456 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	6492 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	2 ms	344 KB	Output is correct
18	Correct	3 ms	348 KB	Output is correct
19	Correct	4 ms	6492 KB	Output is correct
20	Correct	5 ms	2396 KB	Output is correct
21	Correct	3 ms	344 KB	Output is correct
22	Correct	3 ms	460 KB	Output is correct
23	Correct	3 ms	348 KB	Output is correct
24	Correct	4 ms	464 KB	Output is correct
25	Correct	5 ms	348 KB	Output is correct
26	Correct	3 ms	348 KB	Output is correct
27	Correct	3 ms	348 KB	Output is correct
28	Correct	5 ms	344 KB	Output is correct
29	Correct	27 ms	604 KB	Output is correct
30	Correct	38 ms	6832 KB	Output is correct
31	Correct	34 ms	6748 KB	Output is correct
32	Correct	34 ms	604 KB	Output is correct
33	Correct	29 ms	600 KB	Output is correct
34	Correct	27 ms	848 KB	Output is correct
35	Correct	23 ms	604 KB	Output is correct
36	Correct	52 ms	604 KB	Output is correct
37	Correct	38 ms	6744 KB	Output is correct
38	Correct	27 ms	6696 KB	Output is correct
39	Correct	32 ms	816 KB	Output is correct
40	Correct	27 ms	600 KB	Output is correct
41	Correct	46 ms	604 KB	Output is correct
42	Correct	17 ms	600 KB	Output is correct
43	Correct	388 ms	4832 KB	Output is correct
44	Correct	657 ms	8936 KB	Output is correct
45	Correct	662 ms	8928 KB	Output is correct
46	Correct	486 ms	8932 KB	Output is correct
47	Correct	519 ms	7252 KB	Output is correct
48	Correct	467 ms	7132 KB	Output is correct
49	Correct	475 ms	7180 KB	Output is correct
50	Correct	788 ms	7336 KB	Output is correct
51	Correct	804 ms	7316 KB	Output is correct
52	Correct	526 ms	7272 KB	Output is correct
53	Correct	524 ms	7192 KB	Output is correct
54	Correct	808 ms	7268 KB	Output is correct

Subtask #5
0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	6488 KB	Output is correct
3	Correct	1 ms	2508 KB	Output is correct
4	Correct	1 ms	6492 KB	Output is correct
5	Correct	1 ms	456 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	6492 KB	Output is correct
14	Correct	1 ms	344 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	2 ms	344 KB	Output is correct
18	Correct	3 ms	348 KB	Output is correct
19	Correct	4 ms	6492 KB	Output is correct
20	Correct	5 ms	2396 KB	Output is correct
21	Correct	3 ms	344 KB	Output is correct
22	Correct	3 ms	460 KB	Output is correct
23	Correct	3 ms	348 KB	Output is correct
24	Correct	4 ms	464 KB	Output is correct
25	Correct	5 ms	348 KB	Output is correct
26	Correct	3 ms	348 KB	Output is correct
27	Correct	3 ms	348 KB	Output is correct
28	Correct	5 ms	344 KB	Output is correct
29	Correct	27 ms	604 KB	Output is correct
30	Correct	38 ms	6832 KB	Output is correct
31	Correct	34 ms	6748 KB	Output is correct
32	Correct	34 ms	604 KB	Output is correct
33	Correct	29 ms	600 KB	Output is correct
34	Correct	27 ms	848 KB	Output is correct
35	Correct	23 ms	604 KB	Output is correct
36	Correct	52 ms	604 KB	Output is correct
37	Correct	38 ms	6744 KB	Output is correct
38	Correct	27 ms	6696 KB	Output is correct
39	Correct	32 ms	816 KB	Output is correct
40	Correct	27 ms	600 KB	Output is correct
41	Correct	46 ms	604 KB	Output is correct
42	Correct	17 ms	600 KB	Output is correct
43	Correct	388 ms	4832 KB	Output is correct
44	Correct	657 ms	8936 KB	Output is correct
45	Correct	662 ms	8928 KB	Output is correct
46	Correct	486 ms	8932 KB	Output is correct
47	Correct	519 ms	7252 KB	Output is correct
48	Correct	467 ms	7132 KB	Output is correct
49	Correct	475 ms	7180 KB	Output is correct
50	Correct	788 ms	7336 KB	Output is correct
51	Correct	804 ms	7316 KB	Output is correct
52	Correct	526 ms	7272 KB	Output is correct
53	Correct	524 ms	7192 KB	Output is correct
54	Correct	808 ms	7268 KB	Output is correct
55	Correct	4335 ms	49512 KB	Output is correct
56	Correct	5576 ms	76632 KB	Output is correct
57	Correct	6628 ms	76380 KB	Output is correct
58	Correct	4629 ms	75492 KB	Output is correct
59	Correct	4901 ms	75488 KB	Output is correct
60	Correct	4660 ms	75504 KB	Output is correct
61	Correct	4592 ms	75492 KB	Output is correct
62	Execution timed out	7026 ms	76380 KB	Time limit exceeded
63	Halted	0 ms	0 KB	-

답안 #932859

Compilation message

Subtask #1 16.0 / 16.0

Subtask #2 24.0 / 24.0

Subtask #3 21.0 / 21.0

Subtask #4 26.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
26.0 / 26.0

Subtask #5
0 / 13.0