oj.uz

Submission #934475

# Submission time Handle Problem Language Result Execution time Memory
934475 2024-02-27T11:46:30 Z boris_mihov Chorus (JOI23_chorus) C++17
61 / 100
 7000 ms 9816 KB 
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>

typedef long long llong;
const int MAXN = 1000000 + 10;
const llong INF = 1e18;

int n, k;
int h[MAXN];
int next[MAXN];
llong prefix[MAXN];
std::pair <llong,int> dp[MAXN];
int bl[MAXN];
char s[2 * MAXN];

llong cost(int l, int r)
{
    return prefix[r] - (r + 1) * (l - 1);
}

int timer;
std::pair <llong,int> f(int pos, llong penalty)
{
    if (pos == n + 1)
    {
        return {0, 0};
    }

    if (bl[pos] == timer)
    {
        return dp[pos];
    }

    dp[pos] = {INF, 0};
    bl[pos] = timer;

    if (pos < next[pos])
    {
        dp[pos] = f(next[pos], penalty);
        dp[pos].first += penalty;
        dp[pos].second++;
    }

    for (int nextPos = next[pos] + 1 ; nextPos <= n + 1 ; ++nextPos)
    {
        std::pair <llong,int> res = f(nextPos, penalty);
        res.first += (next[pos] - pos + 1) * (pos - 1) + pos * (pos - 1) - prefix[next[pos]] + cost(pos, nextPos - 1) + penalty;
        res.second += 1;

        dp[pos] = std::min(dp[pos], res);
    }

    return dp[pos];
}

void solve()
{
    int cntA = 0;
    int cntB = 0;
    for (int i = 1 ; i <= 2 * n ; ++i)
    {
        if (s[i] == 'B')
        {
            cntB++;
        } else
        {
            cntA++;
            h[cntA] = cntB;
        }
    }

    for (int i = 1 ; i <= n ; ++i)
    {
        prefix[i] = prefix[i - 1] + h[i];
    }

    next[n + 1] = n + 1;
    h[n + 1] = n + 1;
    for (int i = n ; i >= 1 ; --i)
    {
        next[i] = next[i + 1];
        while (next[i] >= i && h[next[i]] >= i)
        {
            next[i]--;
        }
    }

    llong l = -1, r = 1LL * n * n + 1, mid;
    while (l < r - 1)
    {
        timer++;
        mid = (l + r) / 2;
        if (f(1, mid).second > k) l = mid;
        else r = mid;
    }

    timer++;
    auto [fL, groupsL] = f(1, l); timer++;
    auto [fR, groupsR] = f(1, r); 
    fL -= groupsL * l;
    fR -= groupsR * r;

    if (groupsR == k)
    {
        std::cout << fR << '\n';
        return;
    }

    std::cout << fL + (fR - fL) * (groupsL - k) / (groupsL - groupsR) << '\n';
}

void input()
{
    std::cin >> n >> k;
    std::cin >> s + 1;
}

void fastIOI()
{
    std::ios_base :: sync_with_stdio(0);
    std::cout.tie(nullptr);
    std::cin.tie(nullptr);
}

int main()
{
    fastIOI();
    input();
    solve();

    return 0;
}

Compilation message

chorus.cpp: In function 'void input()':
chorus.cpp:118:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  118 |     std::cin >> s + 1;
      |                 ~~^~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 3 ms 6488 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6488 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 2 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 3 ms 6488 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6488 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 15 ms 6492 KB Output is correct
19 Correct 15 ms 6744 KB Output is correct
20 Correct 15 ms 6492 KB Output is correct
21 Correct 15 ms 6704 KB Output is correct
22 Correct 15 ms 6488 KB Output is correct
23 Correct 15 ms 6492 KB Output is correct
24 Correct 15 ms 6492 KB Output is correct
25 Correct 15 ms 6492 KB Output is correct
26 Correct 15 ms 6492 KB Output is correct
27 Correct 15 ms 6680 KB Output is correct
28 Correct 15 ms 6684 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 3 ms 6488 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6488 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 15 ms 6492 KB Output is correct
19 Correct 15 ms 6744 KB Output is correct
20 Correct 15 ms 6492 KB Output is correct
21 Correct 15 ms 6704 KB Output is correct
22 Correct 15 ms 6488 KB Output is correct
23 Correct 15 ms 6492 KB Output is correct
24 Correct 15 ms 6492 KB Output is correct
25 Correct 15 ms 6492 KB Output is correct
26 Correct 15 ms 6492 KB Output is correct
27 Correct 15 ms 6680 KB Output is correct
28 Correct 15 ms 6684 KB Output is correct
29 Correct 1830 ms 7220 KB Output is correct
30 Correct 1822 ms 6748 KB Output is correct
31 Correct 1795 ms 6692 KB Output is correct
32 Correct 1801 ms 7308 KB Output is correct
33 Correct 1809 ms 7512 KB Output is correct
34 Correct 1802 ms 7308 KB Output is correct
35 Correct 2023 ms 7308 KB Output is correct
36 Correct 2004 ms 6776 KB Output is correct
37 Correct 1977 ms 7100 KB Output is correct
38 Correct 1874 ms 7324 KB Output is correct
39 Correct 1859 ms 7504 KB Output is correct
40 Correct 1866 ms 7112 KB Output is correct
41 Correct 1867 ms 7104 KB Output is correct
42 Correct 1016 ms 6992 KB Output is correct

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 3 ms 6488 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6488 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 15 ms 6492 KB Output is correct
19 Correct 15 ms 6744 KB Output is correct
20 Correct 15 ms 6492 KB Output is correct
21 Correct 15 ms 6704 KB Output is correct
22 Correct 15 ms 6488 KB Output is correct
23 Correct 15 ms 6492 KB Output is correct
24 Correct 15 ms 6492 KB Output is correct
25 Correct 15 ms 6492 KB Output is correct
26 Correct 15 ms 6492 KB Output is correct
27 Correct 15 ms 6680 KB Output is correct
28 Correct 15 ms 6684 KB Output is correct
29 Correct 1830 ms 7220 KB Output is correct
30 Correct 1822 ms 6748 KB Output is correct
31 Correct 1795 ms 6692 KB Output is correct
32 Correct 1801 ms 7308 KB Output is correct
33 Correct 1809 ms 7512 KB Output is correct
34 Correct 1802 ms 7308 KB Output is correct
35 Correct 2023 ms 7308 KB Output is correct
36 Correct 2004 ms 6776 KB Output is correct
37 Correct 1977 ms 7100 KB Output is correct
38 Correct 1874 ms 7324 KB Output is correct
39 Correct 1859 ms 7504 KB Output is correct
40 Correct 1866 ms 7112 KB Output is correct
41 Correct 1867 ms 7104 KB Output is correct
42 Correct 1016 ms 6992 KB Output is correct
43 Execution timed out 7041 ms 9816 KB Time limit exceeded
44 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 3 ms 6488 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6488 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 15 ms 6492 KB Output is correct
19 Correct 15 ms 6744 KB Output is correct
20 Correct 15 ms 6492 KB Output is correct
21 Correct 15 ms 6704 KB Output is correct
22 Correct 15 ms 6488 KB Output is correct
23 Correct 15 ms 6492 KB Output is correct
24 Correct 15 ms 6492 KB Output is correct
25 Correct 15 ms 6492 KB Output is correct
26 Correct 15 ms 6492 KB Output is correct
27 Correct 15 ms 6680 KB Output is correct
28 Correct 15 ms 6684 KB Output is correct
29 Correct 1830 ms 7220 KB Output is correct
30 Correct 1822 ms 6748 KB Output is correct
31 Correct 1795 ms 6692 KB Output is correct
32 Correct 1801 ms 7308 KB Output is correct
33 Correct 1809 ms 7512 KB Output is correct
34 Correct 1802 ms 7308 KB Output is correct
35 Correct 2023 ms 7308 KB Output is correct
36 Correct 2004 ms 6776 KB Output is correct
37 Correct 1977 ms 7100 KB Output is correct
38 Correct 1874 ms 7324 KB Output is correct
39 Correct 1859 ms 7504 KB Output is correct
40 Correct 1866 ms 7112 KB Output is correct
41 Correct 1867 ms 7104 KB Output is correct
42 Correct 1016 ms 6992 KB Output is correct
43 Execution timed out 7041 ms 9816 KB Time limit exceeded
44 Halted 0 ms 0 KB -