oj.uz

Submission #932863

# Submission time Handle Problem Language Result Execution time Memory
932863 2024-02-24T10:21:51 Z alextodoran Chorus (JOI23_chorus) C++17
100 / 100
 6540 ms 69028 KB 
/**
 _  _   __  _ _ _  _  _ _
 |a  ||t  ||o    d | |o  |
| __    _| | _ | __|  _ |
| __ |/_  | __  /__\ / _\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;

const int N_MAX = 1000000;
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);

    cin >> N >> K;
    string S;
    cin >> S;
    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 = 90;
    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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2392 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 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2392 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 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 3 ms 6492 KB Output is correct
18 Correct 4 ms 6488 KB Output is correct
19 Correct 4 ms 6492 KB Output is correct
20 Correct 2 ms 2396 KB Output is correct
21 Correct 3 ms 2396 KB Output is correct
22 Correct 2 ms 2396 KB Output is correct
23 Correct 2 ms 2396 KB Output is correct
24 Correct 3 ms 6488 KB Output is correct
25 Correct 3 ms 6488 KB Output is correct
26 Correct 3 ms 6492 KB Output is correct
27 Correct 3 ms 6492 KB Output is correct
28 Correct 3 ms 6648 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2392 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 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 3 ms 6492 KB Output is correct
18 Correct 4 ms 6488 KB Output is correct
19 Correct 4 ms 6492 KB Output is correct
20 Correct 2 ms 2396 KB Output is correct
21 Correct 3 ms 2396 KB Output is correct
22 Correct 2 ms 2396 KB Output is correct
23 Correct 2 ms 2396 KB Output is correct
24 Correct 3 ms 6488 KB Output is correct
25 Correct 3 ms 6488 KB Output is correct
26 Correct 3 ms 6492 KB Output is correct
27 Correct 3 ms 6492 KB Output is correct
28 Correct 3 ms 6648 KB Output is correct
29 Correct 22 ms 6748 KB Output is correct
30 Correct 27 ms 6744 KB Output is correct
31 Correct 27 ms 6848 KB Output is correct
32 Correct 19 ms 2652 KB Output is correct
33 Correct 20 ms 2652 KB Output is correct
34 Correct 20 ms 2648 KB Output is correct
35 Correct 20 ms 2652 KB Output is correct
36 Correct 31 ms 6748 KB Output is correct
37 Correct 29 ms 6744 KB Output is correct
38 Correct 22 ms 6744 KB Output is correct
39 Correct 25 ms 6744 KB Output is correct
40 Correct 22 ms 6744 KB Output is correct
41 Correct 23 ms 6844 KB Output is correct
42 Correct 14 ms 2648 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2392 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 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 3 ms 6492 KB Output is correct
18 Correct 4 ms 6488 KB Output is correct
19 Correct 4 ms 6492 KB Output is correct
20 Correct 2 ms 2396 KB Output is correct
21 Correct 3 ms 2396 KB Output is correct
22 Correct 2 ms 2396 KB Output is correct
23 Correct 2 ms 2396 KB Output is correct
24 Correct 3 ms 6488 KB Output is correct
25 Correct 3 ms 6488 KB Output is correct
26 Correct 3 ms 6492 KB Output is correct
27 Correct 3 ms 6492 KB Output is correct
28 Correct 3 ms 6648 KB Output is correct
29 Correct 22 ms 6748 KB Output is correct
30 Correct 27 ms 6744 KB Output is correct
31 Correct 27 ms 6848 KB Output is correct
32 Correct 19 ms 2652 KB Output is correct
33 Correct 20 ms 2652 KB Output is correct
34 Correct 20 ms 2648 KB Output is correct
35 Correct 20 ms 2652 KB Output is correct
36 Correct 31 ms 6748 KB Output is correct
37 Correct 29 ms 6744 KB Output is correct
38 Correct 22 ms 6744 KB Output is correct
39 Correct 25 ms 6744 KB Output is correct
40 Correct 22 ms 6744 KB Output is correct
41 Correct 23 ms 6844 KB Output is correct
42 Correct 14 ms 2648 KB Output is correct
43 Correct 320 ms 6620 KB Output is correct
44 Correct 539 ms 13336 KB Output is correct
45 Correct 541 ms 13284 KB Output is correct
46 Correct 382 ms 11580 KB Output is correct
47 Correct 398 ms 11332 KB Output is correct
48 Correct 384 ms 11320 KB Output is correct
49 Correct 380 ms 11240 KB Output is correct
50 Correct 624 ms 13448 KB Output is correct
51 Correct 646 ms 13284 KB Output is correct
52 Correct 419 ms 13468 KB Output is correct
53 Correct 420 ms 13776 KB Output is correct
54 Correct 625 ms 13520 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2392 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 6492 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 3 ms 6492 KB Output is correct
18 Correct 4 ms 6488 KB Output is correct
19 Correct 4 ms 6492 KB Output is correct
20 Correct 2 ms 2396 KB Output is correct
21 Correct 3 ms 2396 KB Output is correct
22 Correct 2 ms 2396 KB Output is correct
23 Correct 2 ms 2396 KB Output is correct
24 Correct 3 ms 6488 KB Output is correct
25 Correct 3 ms 6488 KB Output is correct
26 Correct 3 ms 6492 KB Output is correct
27 Correct 3 ms 6492 KB Output is correct
28 Correct 3 ms 6648 KB Output is correct
29 Correct 22 ms 6748 KB Output is correct
30 Correct 27 ms 6744 KB Output is correct
31 Correct 27 ms 6848 KB Output is correct
32 Correct 19 ms 2652 KB Output is correct
33 Correct 20 ms 2652 KB Output is correct
34 Correct 20 ms 2648 KB Output is correct
35 Correct 20 ms 2652 KB Output is correct
36 Correct 31 ms 6748 KB Output is correct
37 Correct 29 ms 6744 KB Output is correct
38 Correct 22 ms 6744 KB Output is correct
39 Correct 25 ms 6744 KB Output is correct
40 Correct 22 ms 6744 KB Output is correct
41 Correct 23 ms 6844 KB Output is correct
42 Correct 14 ms 2648 KB Output is correct
43 Correct 320 ms 6620 KB Output is correct
44 Correct 539 ms 13336 KB Output is correct
45 Correct 541 ms 13284 KB Output is correct
46 Correct 382 ms 11580 KB Output is correct
47 Correct 398 ms 11332 KB Output is correct
48 Correct 384 ms 11320 KB Output is correct
49 Correct 380 ms 11240 KB Output is correct
50 Correct 624 ms 13448 KB Output is correct
51 Correct 646 ms 13284 KB Output is correct
52 Correct 419 ms 13468 KB Output is correct
53 Correct 420 ms 13776 KB Output is correct
54 Correct 625 ms 13520 KB Output is correct
55 Correct 3563 ms 49556 KB Output is correct
56 Correct 4629 ms 66548 KB Output is correct
57 Correct 5561 ms 66364 KB Output is correct
58 Correct 3815 ms 66936 KB Output is correct
59 Correct 3990 ms 66992 KB Output is correct
60 Correct 3849 ms 67060 KB Output is correct
61 Correct 3883 ms 67220 KB Output is correct
62 Correct 6419 ms 66492 KB Output is correct
63 Correct 6540 ms 68344 KB Output is correct
64 Correct 4742 ms 68960 KB Output is correct
65 Correct 4294 ms 68904 KB Output is correct
66 Correct 6426 ms 68592 KB Output is correct
67 Correct 4290 ms 69028 KB Output is correct