oj.uz

Submission #902485

# Submission time Handle Problem Language Result Execution time Memory
902485 2024-01-10T13:25:04 Z Tuanlinh123 Chorus (JOI23_chorus) C++17
87 / 100
 7000 ms 101364 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,popcnt,lzcnt")
#include<bits/stdc++.h>
#define ll long long
#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=2e6, maxn=1e6+5;
ll 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)
    {
        if (a==inf) return {inf*inf, idx};
        return {a*x+b, idx};
    }
};
 
struct Node
{
    Line A;
    Node *l, *r;
};
 
struct Lichao
{
    Node *root=new Node();
    inline void addline(Line A)
    {
        ll Start=-inf, End=inf;
        Node *i=root;
        while (1)
        {
            if (A.a==inf) break;
            ll mid=(Start+End)/2;
            bool l=A.ask(Start).fi<i->A.ask(Start).fi;
            bool m=A.ask(mid).fi<i->A.ask(mid).fi;
            if (m) swap(A, i->A);
            if (Start+1!=End)
            {
                if (l!=m)
                {
                    if (!i->l)
                        i->l=new Node();
                    i=i->l;
                    End=mid;
                }
                else
                {
                    if (!i->r)
                        i->r=new Node();
                    i=i->r;
                    Start=mid;
                }
            }
            else break;
        }
    }
 
    inline pair<long long, ll> query(long long x)
    {
        Node *i=root;
        ll Start=-inf, End=inf;
        pair<long long, ll> ans={inf*inf, 0};
        while (1)
        {
            ll mid=(Start+End)/2;
            ans=min(ans, i->A.ask(x));
            if (x<mid && i->l)
            {
                i=i->l;
                End=mid;
            }
            else if (x>=mid && i->r)
            {
                i=i->r;
                Start=mid;
            }
            else break;
        }
        return ans;
    }

    void destroy(Node *p)
    {
        if (p->l) destroy(p->l);
        if (p->r) destroy(p->r);
        delete(p);
    }
};
 
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;
    }
    A.destroy(A.root);
    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 1 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 6496 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6488 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 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 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 6496 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6488 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 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 3 ms 6496 KB Output is correct
19 Correct 3 ms 6488 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 3 ms 6492 KB Output is correct
23 Correct 3 ms 6492 KB Output is correct
24 Correct 4 ms 6492 KB Output is correct
25 Correct 3 ms 6492 KB Output is correct
26 Correct 3 ms 6492 KB Output is correct
27 Correct 4 ms 6744 KB Output is correct
28 Correct 3 ms 6492 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 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 6496 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6488 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 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 3 ms 6496 KB Output is correct
19 Correct 3 ms 6488 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 3 ms 6492 KB Output is correct
23 Correct 3 ms 6492 KB Output is correct
24 Correct 4 ms 6492 KB Output is correct
25 Correct 3 ms 6492 KB Output is correct
26 Correct 3 ms 6492 KB Output is correct
27 Correct 4 ms 6744 KB Output is correct
28 Correct 3 ms 6492 KB Output is correct
29 Correct 25 ms 6744 KB Output is correct
30 Correct 37 ms 7004 KB Output is correct
31 Correct 25 ms 7004 KB Output is correct
32 Correct 22 ms 7256 KB Output is correct
33 Correct 24 ms 7000 KB Output is correct
34 Correct 26 ms 7004 KB Output is correct
35 Correct 24 ms 7004 KB Output is correct
36 Correct 27 ms 7004 KB Output is correct
37 Correct 27 ms 7004 KB Output is correct
38 Correct 25 ms 7004 KB Output is correct
39 Correct 27 ms 7000 KB Output is correct
40 Correct 25 ms 7000 KB Output is correct
41 Correct 25 ms 7004 KB Output is correct
42 Correct 12 ms 6748 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 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 6496 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6488 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 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 3 ms 6496 KB Output is correct
19 Correct 3 ms 6488 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 3 ms 6492 KB Output is correct
23 Correct 3 ms 6492 KB Output is correct
24 Correct 4 ms 6492 KB Output is correct
25 Correct 3 ms 6492 KB Output is correct
26 Correct 3 ms 6492 KB Output is correct
27 Correct 4 ms 6744 KB Output is correct
28 Correct 3 ms 6492 KB Output is correct
29 Correct 25 ms 6744 KB Output is correct
30 Correct 37 ms 7004 KB Output is correct
31 Correct 25 ms 7004 KB Output is correct
32 Correct 22 ms 7256 KB Output is correct
33 Correct 24 ms 7000 KB Output is correct
34 Correct 26 ms 7004 KB Output is correct
35 Correct 24 ms 7004 KB Output is correct
36 Correct 27 ms 7004 KB Output is correct
37 Correct 27 ms 7004 KB Output is correct
38 Correct 25 ms 7004 KB Output is correct
39 Correct 27 ms 7000 KB Output is correct
40 Correct 25 ms 7000 KB Output is correct
41 Correct 25 ms 7004 KB Output is correct
42 Correct 12 ms 6748 KB Output is correct
43 Correct 436 ms 12868 KB Output is correct
44 Correct 777 ms 17640 KB Output is correct
45 Correct 785 ms 17632 KB Output is correct
46 Correct 750 ms 17924 KB Output is correct
47 Correct 721 ms 17888 KB Output is correct
48 Correct 801 ms 17896 KB Output is correct
49 Correct 757 ms 18052 KB Output is correct
50 Correct 780 ms 17624 KB Output is correct
51 Correct 744 ms 17632 KB Output is correct
52 Correct 853 ms 17996 KB Output is correct
53 Correct 758 ms 17892 KB Output is correct
54 Correct 799 ms 17632 KB Output is correct

Subtask #5
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 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 6496 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6488 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 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 3 ms 6496 KB Output is correct
19 Correct 3 ms 6488 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 3 ms 6492 KB Output is correct
23 Correct 3 ms 6492 KB Output is correct
24 Correct 4 ms 6492 KB Output is correct
25 Correct 3 ms 6492 KB Output is correct
26 Correct 3 ms 6492 KB Output is correct
27 Correct 4 ms 6744 KB Output is correct
28 Correct 3 ms 6492 KB Output is correct
29 Correct 25 ms 6744 KB Output is correct
30 Correct 37 ms 7004 KB Output is correct
31 Correct 25 ms 7004 KB Output is correct
32 Correct 22 ms 7256 KB Output is correct
33 Correct 24 ms 7000 KB Output is correct
34 Correct 26 ms 7004 KB Output is correct
35 Correct 24 ms 7004 KB Output is correct
36 Correct 27 ms 7004 KB Output is correct
37 Correct 27 ms 7004 KB Output is correct
38 Correct 25 ms 7004 KB Output is correct
39 Correct 27 ms 7000 KB Output is correct
40 Correct 25 ms 7000 KB Output is correct
41 Correct 25 ms 7004 KB Output is correct
42 Correct 12 ms 6748 KB Output is correct
43 Correct 436 ms 12868 KB Output is correct
44 Correct 777 ms 17640 KB Output is correct
45 Correct 785 ms 17632 KB Output is correct
46 Correct 750 ms 17924 KB Output is correct
47 Correct 721 ms 17888 KB Output is correct
48 Correct 801 ms 17896 KB Output is correct
49 Correct 757 ms 18052 KB Output is correct
50 Correct 780 ms 17624 KB Output is correct
51 Correct 744 ms 17632 KB Output is correct
52 Correct 853 ms 17996 KB Output is correct
53 Correct 758 ms 17892 KB Output is correct
54 Correct 799 ms 17632 KB Output is correct
55 Correct 6131 ms 72732 KB Output is correct
56 Execution timed out 7049 ms 101364 KB Time limit exceeded
57 Halted 0 ms 0 KB -