oj.uz

Submission #902684

# Submission time Handle Problem Language Result Execution time Memory
902684 2024-01-11T00:08:09 Z Tuanlinh123 Chorus (JOI23_chorus) C++17
87 / 100
 7000 ms 661972 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=inf, b=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(long long 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=0, 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(long long x)
    {
        ll Start=0, 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 276 ms 626592 KB Output is correct
2 Correct 213 ms 626532 KB Output is correct
3 Correct 196 ms 626532 KB Output is correct
4 Correct 195 ms 626596 KB Output is correct
5 Correct 215 ms 626472 KB Output is correct
6 Correct 194 ms 626596 KB Output is correct
7 Correct 183 ms 626604 KB Output is correct
8 Correct 192 ms 626516 KB Output is correct
9 Correct 175 ms 626912 KB Output is correct
10 Correct 190 ms 626908 KB Output is correct
11 Correct 187 ms 626548 KB Output is correct
12 Correct 187 ms 626476 KB Output is correct
13 Correct 183 ms 626512 KB Output is correct
14 Correct 192 ms 626516 KB Output is correct
15 Correct 191 ms 626520 KB Output is correct
16 Correct 179 ms 626668 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 276 ms 626592 KB Output is correct
2 Correct 213 ms 626532 KB Output is correct
3 Correct 196 ms 626532 KB Output is correct
4 Correct 195 ms 626596 KB Output is correct
5 Correct 215 ms 626472 KB Output is correct
6 Correct 194 ms 626596 KB Output is correct
7 Correct 183 ms 626604 KB Output is correct
8 Correct 192 ms 626516 KB Output is correct
9 Correct 175 ms 626912 KB Output is correct
10 Correct 190 ms 626908 KB Output is correct
11 Correct 187 ms 626548 KB Output is correct
12 Correct 187 ms 626476 KB Output is correct
13 Correct 183 ms 626512 KB Output is correct
14 Correct 192 ms 626516 KB Output is correct
15 Correct 191 ms 626520 KB Output is correct
16 Correct 179 ms 626668 KB Output is correct
17 Correct 198 ms 626792 KB Output is correct
18 Correct 209 ms 626672 KB Output is correct
19 Correct 188 ms 626544 KB Output is correct
20 Correct 192 ms 626820 KB Output is correct
21 Correct 178 ms 626460 KB Output is correct
22 Correct 195 ms 626604 KB Output is correct
23 Correct 193 ms 626892 KB Output is correct
24 Correct 195 ms 626644 KB Output is correct
25 Correct 181 ms 626624 KB Output is correct
26 Correct 176 ms 626676 KB Output is correct
27 Correct 172 ms 626516 KB Output is correct
28 Correct 167 ms 626508 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 276 ms 626592 KB Output is correct
2 Correct 213 ms 626532 KB Output is correct
3 Correct 196 ms 626532 KB Output is correct
4 Correct 195 ms 626596 KB Output is correct
5 Correct 215 ms 626472 KB Output is correct
6 Correct 194 ms 626596 KB Output is correct
7 Correct 183 ms 626604 KB Output is correct
8 Correct 192 ms 626516 KB Output is correct
9 Correct 175 ms 626912 KB Output is correct
10 Correct 190 ms 626908 KB Output is correct
11 Correct 187 ms 626548 KB Output is correct
12 Correct 187 ms 626476 KB Output is correct
13 Correct 183 ms 626512 KB Output is correct
14 Correct 192 ms 626516 KB Output is correct
15 Correct 191 ms 626520 KB Output is correct
16 Correct 179 ms 626668 KB Output is correct
17 Correct 198 ms 626792 KB Output is correct
18 Correct 209 ms 626672 KB Output is correct
19 Correct 188 ms 626544 KB Output is correct
20 Correct 192 ms 626820 KB Output is correct
21 Correct 178 ms 626460 KB Output is correct
22 Correct 195 ms 626604 KB Output is correct
23 Correct 193 ms 626892 KB Output is correct
24 Correct 195 ms 626644 KB Output is correct
25 Correct 181 ms 626624 KB Output is correct
26 Correct 176 ms 626676 KB Output is correct
27 Correct 172 ms 626516 KB Output is correct
28 Correct 167 ms 626508 KB Output is correct
29 Correct 190 ms 626884 KB Output is correct
30 Correct 207 ms 626656 KB Output is correct
31 Correct 181 ms 626884 KB Output is correct
32 Correct 185 ms 626780 KB Output is correct
33 Correct 202 ms 626872 KB Output is correct
34 Correct 188 ms 626780 KB Output is correct
35 Correct 214 ms 626768 KB Output is correct
36 Correct 183 ms 626768 KB Output is correct
37 Correct 184 ms 626772 KB Output is correct
38 Correct 185 ms 626868 KB Output is correct
39 Correct 195 ms 626880 KB Output is correct
40 Correct 186 ms 626768 KB Output is correct
41 Correct 192 ms 627032 KB Output is correct
42 Correct 213 ms 626768 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 276 ms 626592 KB Output is correct
2 Correct 213 ms 626532 KB Output is correct
3 Correct 196 ms 626532 KB Output is correct
4 Correct 195 ms 626596 KB Output is correct
5 Correct 215 ms 626472 KB Output is correct
6 Correct 194 ms 626596 KB Output is correct
7 Correct 183 ms 626604 KB Output is correct
8 Correct 192 ms 626516 KB Output is correct
9 Correct 175 ms 626912 KB Output is correct
10 Correct 190 ms 626908 KB Output is correct
11 Correct 187 ms 626548 KB Output is correct
12 Correct 187 ms 626476 KB Output is correct
13 Correct 183 ms 626512 KB Output is correct
14 Correct 192 ms 626516 KB Output is correct
15 Correct 191 ms 626520 KB Output is correct
16 Correct 179 ms 626668 KB Output is correct
17 Correct 198 ms 626792 KB Output is correct
18 Correct 209 ms 626672 KB Output is correct
19 Correct 188 ms 626544 KB Output is correct
20 Correct 192 ms 626820 KB Output is correct
21 Correct 178 ms 626460 KB Output is correct
22 Correct 195 ms 626604 KB Output is correct
23 Correct 193 ms 626892 KB Output is correct
24 Correct 195 ms 626644 KB Output is correct
25 Correct 181 ms 626624 KB Output is correct
26 Correct 176 ms 626676 KB Output is correct
27 Correct 172 ms 626516 KB Output is correct
28 Correct 167 ms 626508 KB Output is correct
29 Correct 190 ms 626884 KB Output is correct
30 Correct 207 ms 626656 KB Output is correct
31 Correct 181 ms 626884 KB Output is correct
32 Correct 185 ms 626780 KB Output is correct
33 Correct 202 ms 626872 KB Output is correct
34 Correct 188 ms 626780 KB Output is correct
35 Correct 214 ms 626768 KB Output is correct
36 Correct 183 ms 626768 KB Output is correct
37 Correct 184 ms 626772 KB Output is correct
38 Correct 185 ms 626868 KB Output is correct
39 Correct 195 ms 626880 KB Output is correct
40 Correct 186 ms 626768 KB Output is correct
41 Correct 192 ms 627032 KB Output is correct
42 Correct 213 ms 626768 KB Output is correct
43 Correct 551 ms 628928 KB Output is correct
44 Correct 794 ms 630192 KB Output is correct
45 Correct 769 ms 630296 KB Output is correct
46 Correct 581 ms 630120 KB Output is correct
47 Correct 674 ms 630276 KB Output is correct
48 Correct 794 ms 630460 KB Output is correct
49 Correct 772 ms 630492 KB Output is correct
50 Correct 765 ms 630248 KB Output is correct
51 Correct 841 ms 630240 KB Output is correct
52 Correct 784 ms 630152 KB Output is correct
53 Correct 777 ms 630188 KB Output is correct
54 Correct 822 ms 630168 KB Output is correct

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 276 ms 626592 KB Output is correct
2 Correct 213 ms 626532 KB Output is correct
3 Correct 196 ms 626532 KB Output is correct
4 Correct 195 ms 626596 KB Output is correct
5 Correct 215 ms 626472 KB Output is correct
6 Correct 194 ms 626596 KB Output is correct
7 Correct 183 ms 626604 KB Output is correct
8 Correct 192 ms 626516 KB Output is correct
9 Correct 175 ms 626912 KB Output is correct
10 Correct 190 ms 626908 KB Output is correct
11 Correct 187 ms 626548 KB Output is correct
12 Correct 187 ms 626476 KB Output is correct
13 Correct 183 ms 626512 KB Output is correct
14 Correct 192 ms 626516 KB Output is correct
15 Correct 191 ms 626520 KB Output is correct
16 Correct 179 ms 626668 KB Output is correct
17 Correct 198 ms 626792 KB Output is correct
18 Correct 209 ms 626672 KB Output is correct
19 Correct 188 ms 626544 KB Output is correct
20 Correct 192 ms 626820 KB Output is correct
21 Correct 178 ms 626460 KB Output is correct
22 Correct 195 ms 626604 KB Output is correct
23 Correct 193 ms 626892 KB Output is correct
24 Correct 195 ms 626644 KB Output is correct
25 Correct 181 ms 626624 KB Output is correct
26 Correct 176 ms 626676 KB Output is correct
27 Correct 172 ms 626516 KB Output is correct
28 Correct 167 ms 626508 KB Output is correct
29 Correct 190 ms 626884 KB Output is correct
30 Correct 207 ms 626656 KB Output is correct
31 Correct 181 ms 626884 KB Output is correct
32 Correct 185 ms 626780 KB Output is correct
33 Correct 202 ms 626872 KB Output is correct
34 Correct 188 ms 626780 KB Output is correct
35 Correct 214 ms 626768 KB Output is correct
36 Correct 183 ms 626768 KB Output is correct
37 Correct 184 ms 626772 KB Output is correct
38 Correct 185 ms 626868 KB Output is correct
39 Correct 195 ms 626880 KB Output is correct
40 Correct 186 ms 626768 KB Output is correct
41 Correct 192 ms 627032 KB Output is correct
42 Correct 213 ms 626768 KB Output is correct
43 Correct 551 ms 628928 KB Output is correct
44 Correct 794 ms 630192 KB Output is correct
45 Correct 769 ms 630296 KB Output is correct
46 Correct 581 ms 630120 KB Output is correct
47 Correct 674 ms 630276 KB Output is correct
48 Correct 794 ms 630460 KB Output is correct
49 Correct 772 ms 630492 KB Output is correct
50 Correct 765 ms 630248 KB Output is correct
51 Correct 841 ms 630240 KB Output is correct
52 Correct 784 ms 630152 KB Output is correct
53 Correct 777 ms 630188 KB Output is correct
54 Correct 822 ms 630168 KB Output is correct
55 Correct 4802 ms 649504 KB Output is correct
56 Execution timed out 7036 ms 661972 KB Time limit exceeded
57 Halted 0 ms 0 KB -