oj.uz

Submission #902510

# Submission time Handle Problem Language Result Execution time Memory
902510 2024-01-10T14:05:34 Z Tuanlinh123 Chorus (JOI23_chorus) C++17
87 / 100
 7000 ms 661716 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,popcnt,lzcnt")
#include<bits/stdc++.h>
#define ll int
#define pll pair<ll, ll>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ld long double
using namespace std;
 
const long long inf=1e6, maxn=1e6+5;
long long cnt[maxn], to[maxn];
long long n, k, dp[maxn], pre[maxn];
 
struct Line
{
    long long a=0, b=inf*inf;
    ll idx=0;
 
    Line(){}
    Line(long long a, long long b, ll idx): a(a), b(b), idx(idx){}
    inline pair<long long, ll> ask(ll x){return {a*x+b, idx};}
};
 
struct Node
{
    Line A;
    ll l=0, r=0;
};
Node LC[maxn*20];

struct Lichao
{
    ll crr;
    Lichao()
    {
        crr=0;
        LC[0]=Node();
    }
    inline void addline(Line A)
    {
        ll Start=-inf, End=inf, i=0;
        while (1)
        {
            ll mid=(Start+End)/2;
            bool l=A.ask(Start).fi<LC[i].A.ask(Start).fi;
            bool m=A.ask(mid).fi<LC[i].A.ask(mid).fi;
            if (m) swap(A, LC[i].A);
            if (A.a==inf) break;
            if (Start+1!=End)
            {
                if (l!=m)
                {
                    if (!LC[i].l)
                    {
                        LC[i].l=++crr;
                        LC[crr]=Node();
                    }
                    i=LC[i].l;
                    End=mid;
                }
                else
                {
                    if (!LC[i].r)
                    {
                        LC[i].r=++crr;
                        LC[crr]=Node();
                    }
                    i=LC[i].r;
                    Start=mid;
                }
            }
            else break;
        }
    }
 
    inline pair<long long, ll> query(ll x)
    {
        ll Start=-inf, End=inf, i=0;
        pair<long long, ll> ans={inf*inf, 0};
        while (1)
        {
            ll mid=(Start+End)/2;
            ans=min(ans, LC[i].A.ask(x));
            if (x<mid && LC[i].l)
            {
                i=LC[i].l;
                End=mid;
            }
            else if (x>=mid && LC[i].r)
            {
                i=LC[i].r;
                Start=mid;
            }
            else break;
        }
        return ans;
    }
};
 
pair<long long, ll> solve(long long C)
{
    ll crr=1;
    Lichao A; A.addline(Line(0, -pre[to[0]-1], 0));
    for (ll i=1; i<=n; i++)
        dp[i]=inf*inf, cnt[i]=0;
    for (ll i=1; i<=n; i++)
    {
        while (crr<i && to[crr]<=i)
            A.addline(Line(-crr, -(pre[to[crr]-1]-(to[crr]-1)*crr)+dp[crr], cnt[crr])), crr++;
        tie(dp[i], cnt[i])=A.query(i); 
        dp[i]+=C+pre[i], cnt[i]++;
        if (crr<i && dp[crr]+C<dp[i])
            dp[i]=dp[crr]+C, cnt[i]=cnt[crr]+1;
    }
    return {dp[n], cnt[n]};
}
 
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> n >> k;
    string s; cin >> s;
    long long x=0, y=0, crr=1;
    for (ll i=0; i<n*2; i++)
    {
        if (s[i]=='A')
            x++, pre[x]=pre[x-1]+y;
        else y++;
    }
    for (ll i=1; i<=n; i++)
        while (crr<=pre[i]-pre[i-1])
            to[crr]=i, crr++;
    while (crr<=n) to[crr]=n+1, crr++;
    for (ll i=0; i<=n; i++)
        if (to[i]<=i)
            to[i]=i+1;
    long long lo=0, hi=1LL*n*n;
    while (hi>lo)
    {
        long long mid=(lo+hi)/2;
        if (solve(mid).se<=k)
            hi=mid;
        else lo=mid+1;
    }
    cout << 0LL+solve(lo).fi-lo*k;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 626536 KB Output is correct
2 Correct 134 ms 626508 KB Output is correct
3 Correct 134 ms 626748 KB Output is correct
4 Correct 131 ms 626516 KB Output is correct
5 Correct 129 ms 626512 KB Output is correct
6 Correct 138 ms 626648 KB Output is correct
7 Correct 132 ms 626608 KB Output is correct
8 Correct 141 ms 626516 KB Output is correct
9 Correct 135 ms 626668 KB Output is correct
10 Correct 128 ms 626628 KB Output is correct
11 Correct 132 ms 626672 KB Output is correct
12 Correct 130 ms 626700 KB Output is correct
13 Correct 127 ms 626576 KB Output is correct
14 Correct 126 ms 626544 KB Output is correct
15 Correct 135 ms 626768 KB Output is correct
16 Correct 125 ms 626516 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 626536 KB Output is correct
2 Correct 134 ms 626508 KB Output is correct
3 Correct 134 ms 626748 KB Output is correct
4 Correct 131 ms 626516 KB Output is correct
5 Correct 129 ms 626512 KB Output is correct
6 Correct 138 ms 626648 KB Output is correct
7 Correct 132 ms 626608 KB Output is correct
8 Correct 141 ms 626516 KB Output is correct
9 Correct 135 ms 626668 KB Output is correct
10 Correct 128 ms 626628 KB Output is correct
11 Correct 132 ms 626672 KB Output is correct
12 Correct 130 ms 626700 KB Output is correct
13 Correct 127 ms 626576 KB Output is correct
14 Correct 126 ms 626544 KB Output is correct
15 Correct 135 ms 626768 KB Output is correct
16 Correct 125 ms 626516 KB Output is correct
17 Correct 142 ms 626576 KB Output is correct
18 Correct 143 ms 626500 KB Output is correct
19 Correct 143 ms 626616 KB Output is correct
20 Correct 149 ms 626512 KB Output is correct
21 Correct 136 ms 626512 KB Output is correct
22 Correct 131 ms 626696 KB Output is correct
23 Correct 132 ms 626516 KB Output is correct
24 Correct 129 ms 626476 KB Output is correct
25 Correct 130 ms 626652 KB Output is correct
26 Correct 141 ms 626912 KB Output is correct
27 Correct 129 ms 626668 KB Output is correct
28 Correct 162 ms 626584 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 626536 KB Output is correct
2 Correct 134 ms 626508 KB Output is correct
3 Correct 134 ms 626748 KB Output is correct
4 Correct 131 ms 626516 KB Output is correct
5 Correct 129 ms 626512 KB Output is correct
6 Correct 138 ms 626648 KB Output is correct
7 Correct 132 ms 626608 KB Output is correct
8 Correct 141 ms 626516 KB Output is correct
9 Correct 135 ms 626668 KB Output is correct
10 Correct 128 ms 626628 KB Output is correct
11 Correct 132 ms 626672 KB Output is correct
12 Correct 130 ms 626700 KB Output is correct
13 Correct 127 ms 626576 KB Output is correct
14 Correct 126 ms 626544 KB Output is correct
15 Correct 135 ms 626768 KB Output is correct
16 Correct 125 ms 626516 KB Output is correct
17 Correct 142 ms 626576 KB Output is correct
18 Correct 143 ms 626500 KB Output is correct
19 Correct 143 ms 626616 KB Output is correct
20 Correct 149 ms 626512 KB Output is correct
21 Correct 136 ms 626512 KB Output is correct
22 Correct 131 ms 626696 KB Output is correct
23 Correct 132 ms 626516 KB Output is correct
24 Correct 129 ms 626476 KB Output is correct
25 Correct 130 ms 626652 KB Output is correct
26 Correct 141 ms 626912 KB Output is correct
27 Correct 129 ms 626668 KB Output is correct
28 Correct 162 ms 626584 KB Output is correct
29 Correct 154 ms 626880 KB Output is correct
30 Correct 153 ms 626916 KB Output is correct
31 Correct 152 ms 626772 KB Output is correct
32 Correct 155 ms 626772 KB Output is correct
33 Correct 158 ms 627032 KB Output is correct
34 Correct 183 ms 626664 KB Output is correct
35 Correct 171 ms 626772 KB Output is correct
36 Correct 159 ms 626640 KB Output is correct
37 Correct 161 ms 626852 KB Output is correct
38 Correct 155 ms 626768 KB Output is correct
39 Correct 160 ms 626776 KB Output is correct
40 Correct 165 ms 626888 KB Output is correct
41 Correct 158 ms 626764 KB Output is correct
42 Correct 149 ms 626816 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 626536 KB Output is correct
2 Correct 134 ms 626508 KB Output is correct
3 Correct 134 ms 626748 KB Output is correct
4 Correct 131 ms 626516 KB Output is correct
5 Correct 129 ms 626512 KB Output is correct
6 Correct 138 ms 626648 KB Output is correct
7 Correct 132 ms 626608 KB Output is correct
8 Correct 141 ms 626516 KB Output is correct
9 Correct 135 ms 626668 KB Output is correct
10 Correct 128 ms 626628 KB Output is correct
11 Correct 132 ms 626672 KB Output is correct
12 Correct 130 ms 626700 KB Output is correct
13 Correct 127 ms 626576 KB Output is correct
14 Correct 126 ms 626544 KB Output is correct
15 Correct 135 ms 626768 KB Output is correct
16 Correct 125 ms 626516 KB Output is correct
17 Correct 142 ms 626576 KB Output is correct
18 Correct 143 ms 626500 KB Output is correct
19 Correct 143 ms 626616 KB Output is correct
20 Correct 149 ms 626512 KB Output is correct
21 Correct 136 ms 626512 KB Output is correct
22 Correct 131 ms 626696 KB Output is correct
23 Correct 132 ms 626516 KB Output is correct
24 Correct 129 ms 626476 KB Output is correct
25 Correct 130 ms 626652 KB Output is correct
26 Correct 141 ms 626912 KB Output is correct
27 Correct 129 ms 626668 KB Output is correct
28 Correct 162 ms 626584 KB Output is correct
29 Correct 154 ms 626880 KB Output is correct
30 Correct 153 ms 626916 KB Output is correct
31 Correct 152 ms 626772 KB Output is correct
32 Correct 155 ms 626772 KB Output is correct
33 Correct 158 ms 627032 KB Output is correct
34 Correct 183 ms 626664 KB Output is correct
35 Correct 171 ms 626772 KB Output is correct
36 Correct 159 ms 626640 KB Output is correct
37 Correct 161 ms 626852 KB Output is correct
38 Correct 155 ms 626768 KB Output is correct
39 Correct 160 ms 626776 KB Output is correct
40 Correct 165 ms 626888 KB Output is correct
41 Correct 158 ms 626764 KB Output is correct
42 Correct 149 ms 626816 KB Output is correct
43 Correct 530 ms 628924 KB Output is correct
44 Correct 829 ms 630148 KB Output is correct
45 Correct 861 ms 630328 KB Output is correct
46 Correct 818 ms 630188 KB Output is correct
47 Correct 802 ms 630156 KB Output is correct
48 Correct 842 ms 630240 KB Output is correct
49 Correct 860 ms 630240 KB Output is correct
50 Correct 840 ms 630212 KB Output is correct
51 Correct 859 ms 630236 KB Output is correct
52 Correct 846 ms 630300 KB Output is correct
53 Correct 896 ms 630156 KB Output is correct
54 Correct 869 ms 630236 KB Output is correct

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 626536 KB Output is correct
2 Correct 134 ms 626508 KB Output is correct
3 Correct 134 ms 626748 KB Output is correct
4 Correct 131 ms 626516 KB Output is correct
5 Correct 129 ms 626512 KB Output is correct
6 Correct 138 ms 626648 KB Output is correct
7 Correct 132 ms 626608 KB Output is correct
8 Correct 141 ms 626516 KB Output is correct
9 Correct 135 ms 626668 KB Output is correct
10 Correct 128 ms 626628 KB Output is correct
11 Correct 132 ms 626672 KB Output is correct
12 Correct 130 ms 626700 KB Output is correct
13 Correct 127 ms 626576 KB Output is correct
14 Correct 126 ms 626544 KB Output is correct
15 Correct 135 ms 626768 KB Output is correct
16 Correct 125 ms 626516 KB Output is correct
17 Correct 142 ms 626576 KB Output is correct
18 Correct 143 ms 626500 KB Output is correct
19 Correct 143 ms 626616 KB Output is correct
20 Correct 149 ms 626512 KB Output is correct
21 Correct 136 ms 626512 KB Output is correct
22 Correct 131 ms 626696 KB Output is correct
23 Correct 132 ms 626516 KB Output is correct
24 Correct 129 ms 626476 KB Output is correct
25 Correct 130 ms 626652 KB Output is correct
26 Correct 141 ms 626912 KB Output is correct
27 Correct 129 ms 626668 KB Output is correct
28 Correct 162 ms 626584 KB Output is correct
29 Correct 154 ms 626880 KB Output is correct
30 Correct 153 ms 626916 KB Output is correct
31 Correct 152 ms 626772 KB Output is correct
32 Correct 155 ms 626772 KB Output is correct
33 Correct 158 ms 627032 KB Output is correct
34 Correct 183 ms 626664 KB Output is correct
35 Correct 171 ms 626772 KB Output is correct
36 Correct 159 ms 626640 KB Output is correct
37 Correct 161 ms 626852 KB Output is correct
38 Correct 155 ms 626768 KB Output is correct
39 Correct 160 ms 626776 KB Output is correct
40 Correct 165 ms 626888 KB Output is correct
41 Correct 158 ms 626764 KB Output is correct
42 Correct 149 ms 626816 KB Output is correct
43 Correct 530 ms 628924 KB Output is correct
44 Correct 829 ms 630148 KB Output is correct
45 Correct 861 ms 630328 KB Output is correct
46 Correct 818 ms 630188 KB Output is correct
47 Correct 802 ms 630156 KB Output is correct
48 Correct 842 ms 630240 KB Output is correct
49 Correct 860 ms 630240 KB Output is correct
50 Correct 840 ms 630212 KB Output is correct
51 Correct 859 ms 630236 KB Output is correct
52 Correct 846 ms 630300 KB Output is correct
53 Correct 896 ms 630156 KB Output is correct
54 Correct 869 ms 630236 KB Output is correct
55 Correct 5421 ms 649396 KB Output is correct
56 Execution timed out 7036 ms 661716 KB Time limit exceeded
57 Halted 0 ms 0 KB -