oj.uz

Submission #957255

# Submission time Handle Problem Language Result Execution time Memory
957255 2024-04-03T10:27:20 Z alextodoran Chorus (JOI23_chorus) C++17
100 / 100
 2521 ms 45816 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;

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

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

struct Line {
    ll a, b;
    ll 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 <ll, 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 (ll 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 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;
    }
    ll l = 0, r = LLONG_MAX / 2;
    while (l < r) {
        ld mid = (l + r) / 2;
        solve(mid);
        if (cnt[N] <= K) {
            r = mid;
        } else {
            l = mid + 1;
        }
    }
    cout << solve(l) << "\n";

    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 1 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 6616 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2392 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 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 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 1 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 6616 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2392 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 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 1 ms 6492 KB Output is correct
18 Correct 2 ms 6632 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 2 ms 6608 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Correct 2 ms 6492 KB Output is correct
27 Correct 2 ms 6604 KB Output is correct
28 Correct 2 ms 6604 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 1 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 6616 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2392 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 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 1 ms 6492 KB Output is correct
18 Correct 2 ms 6632 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 2 ms 6608 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Correct 2 ms 6492 KB Output is correct
27 Correct 2 ms 6604 KB Output is correct
28 Correct 2 ms 6604 KB Output is correct
29 Correct 8 ms 6744 KB Output is correct
30 Correct 11 ms 6748 KB Output is correct
31 Correct 12 ms 6780 KB Output is correct
32 Correct 7 ms 2652 KB Output is correct
33 Correct 7 ms 2652 KB Output is correct
34 Correct 7 ms 2652 KB Output is correct
35 Correct 9 ms 2648 KB Output is correct
36 Correct 12 ms 6776 KB Output is correct
37 Correct 11 ms 6748 KB Output is correct
38 Correct 8 ms 6748 KB Output is correct
39 Correct 10 ms 6748 KB Output is correct
40 Correct 8 ms 6748 KB Output is correct
41 Correct 8 ms 6744 KB Output is correct
42 Correct 6 ms 2652 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 1 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 6616 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2392 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 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 1 ms 6492 KB Output is correct
18 Correct 2 ms 6632 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 2 ms 6608 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Correct 2 ms 6492 KB Output is correct
27 Correct 2 ms 6604 KB Output is correct
28 Correct 2 ms 6604 KB Output is correct
29 Correct 8 ms 6744 KB Output is correct
30 Correct 11 ms 6748 KB Output is correct
31 Correct 12 ms 6780 KB Output is correct
32 Correct 7 ms 2652 KB Output is correct
33 Correct 7 ms 2652 KB Output is correct
34 Correct 7 ms 2652 KB Output is correct
35 Correct 9 ms 2648 KB Output is correct
36 Correct 12 ms 6776 KB Output is correct
37 Correct 11 ms 6748 KB Output is correct
38 Correct 8 ms 6748 KB Output is correct
39 Correct 10 ms 6748 KB Output is correct
40 Correct 8 ms 6748 KB Output is correct
41 Correct 8 ms 6744 KB Output is correct
42 Correct 6 ms 2652 KB Output is correct
43 Correct 135 ms 6488 KB Output is correct
44 Correct 222 ms 9972 KB Output is correct
45 Correct 231 ms 10016 KB Output is correct
46 Correct 128 ms 7144 KB Output is correct
47 Correct 157 ms 7216 KB Output is correct
48 Correct 134 ms 7236 KB Output is correct
49 Correct 135 ms 7140 KB Output is correct
50 Correct 231 ms 10132 KB Output is correct
51 Correct 231 ms 10136 KB Output is correct
52 Correct 145 ms 10132 KB Output is correct
53 Correct 145 ms 10460 KB Output is correct
54 Correct 232 ms 10128 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 1 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 6616 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2392 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 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 1 ms 6492 KB Output is correct
18 Correct 2 ms 6632 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 2 ms 6608 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Correct 2 ms 6492 KB Output is correct
27 Correct 2 ms 6604 KB Output is correct
28 Correct 2 ms 6604 KB Output is correct
29 Correct 8 ms 6744 KB Output is correct
30 Correct 11 ms 6748 KB Output is correct
31 Correct 12 ms 6780 KB Output is correct
32 Correct 7 ms 2652 KB Output is correct
33 Correct 7 ms 2652 KB Output is correct
34 Correct 7 ms 2652 KB Output is correct
35 Correct 9 ms 2648 KB Output is correct
36 Correct 12 ms 6776 KB Output is correct
37 Correct 11 ms 6748 KB Output is correct
38 Correct 8 ms 6748 KB Output is correct
39 Correct 10 ms 6748 KB Output is correct
40 Correct 8 ms 6748 KB Output is correct
41 Correct 8 ms 6744 KB Output is correct
42 Correct 6 ms 2652 KB Output is correct
43 Correct 135 ms 6488 KB Output is correct
44 Correct 222 ms 9972 KB Output is correct
45 Correct 231 ms 10016 KB Output is correct
46 Correct 128 ms 7144 KB Output is correct
47 Correct 157 ms 7216 KB Output is correct
48 Correct 134 ms 7236 KB Output is correct
49 Correct 135 ms 7140 KB Output is correct
50 Correct 231 ms 10132 KB Output is correct
51 Correct 231 ms 10136 KB Output is correct
52 Correct 145 ms 10132 KB Output is correct
53 Correct 145 ms 10460 KB Output is correct
54 Correct 232 ms 10128 KB Output is correct
55 Correct 1464 ms 30556 KB Output is correct
56 Correct 1817 ms 45144 KB Output is correct
57 Correct 2289 ms 44824 KB Output is correct
58 Correct 1228 ms 45568 KB Output is correct
59 Correct 1306 ms 45480 KB Output is correct
60 Correct 1386 ms 45416 KB Output is correct
61 Correct 1377 ms 45412 KB Output is correct
62 Correct 2367 ms 45040 KB Output is correct
63 Correct 2521 ms 44908 KB Output is correct
64 Correct 1513 ms 45460 KB Output is correct
65 Correct 1448 ms 45436 KB Output is correct
66 Correct 2382 ms 45008 KB Output is correct
67 Correct 1486 ms 45816 KB Output is correct