oj.uz

Submission #902477

# Submission time Handle Problem Language Result Execution time Memory
902477 2024-01-10T13:11:21 Z Tuanlinh123 Chorus (JOI23_chorus) C++17
87 / 100
 7000 ms 103216 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 ll inf=2e6, maxn=1e6+5;
ll n, k, pre[maxn], to[maxn];
ll dp[maxn], cnt[maxn];
 
struct Line
{
    ll a=inf, b=inf, idx=0;
 
    Line(){}
    Line(ll a, ll b, ll idx): a(a), b(b), idx(idx){}
    pll ask(ll 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();
    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;
        }
    }
 
    pll query(ll x)
    {
        Node *i=root;
        ll Start=-inf, End=inf;
        pll 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);
    }
};
 
ll cost(ll j, ll i)
{
    if (to[j]>i) return 0;
    return (pre[i]-i*j)-(pre[to[j]-1]-(to[j]-1)*j);
}
 
pll solve(ll 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;
    ll 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;
    ll lo=0, hi=n*n;
    while (hi>lo)
    {
        ll mid=(lo+hi)/2;
        if (solve(mid).se<=k)
            hi=mid;
        else lo=mid+1;
    }
    cout << solve(lo).fi-k*lo;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4696 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4564 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4696 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4696 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4564 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4696 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 2 ms 4444 KB Output is correct
19 Correct 3 ms 4564 KB Output is correct
20 Correct 2 ms 4440 KB Output is correct
21 Correct 2 ms 4444 KB Output is correct
22 Correct 3 ms 4444 KB Output is correct
23 Correct 3 ms 4440 KB Output is correct
24 Correct 3 ms 4440 KB Output is correct
25 Correct 4 ms 4440 KB Output is correct
26 Correct 3 ms 4444 KB Output is correct
27 Correct 3 ms 4444 KB Output is correct
28 Correct 3 ms 4696 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4696 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4564 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4696 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 2 ms 4444 KB Output is correct
19 Correct 3 ms 4564 KB Output is correct
20 Correct 2 ms 4440 KB Output is correct
21 Correct 2 ms 4444 KB Output is correct
22 Correct 3 ms 4444 KB Output is correct
23 Correct 3 ms 4440 KB Output is correct
24 Correct 3 ms 4440 KB Output is correct
25 Correct 4 ms 4440 KB Output is correct
26 Correct 3 ms 4444 KB Output is correct
27 Correct 3 ms 4444 KB Output is correct
28 Correct 3 ms 4696 KB Output is correct
29 Correct 25 ms 4956 KB Output is correct
30 Correct 26 ms 4816 KB Output is correct
31 Correct 25 ms 5016 KB Output is correct
32 Correct 24 ms 4952 KB Output is correct
33 Correct 24 ms 5040 KB Output is correct
34 Correct 30 ms 4952 KB Output is correct
35 Correct 24 ms 4956 KB Output is correct
36 Correct 38 ms 4952 KB Output is correct
37 Correct 28 ms 4956 KB Output is correct
38 Correct 24 ms 4952 KB Output is correct
39 Correct 26 ms 4956 KB Output is correct
40 Correct 25 ms 5012 KB Output is correct
41 Correct 25 ms 4956 KB Output is correct
42 Correct 11 ms 4696 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4696 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4564 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4696 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 2 ms 4444 KB Output is correct
19 Correct 3 ms 4564 KB Output is correct
20 Correct 2 ms 4440 KB Output is correct
21 Correct 2 ms 4444 KB Output is correct
22 Correct 3 ms 4444 KB Output is correct
23 Correct 3 ms 4440 KB Output is correct
24 Correct 3 ms 4440 KB Output is correct
25 Correct 4 ms 4440 KB Output is correct
26 Correct 3 ms 4444 KB Output is correct
27 Correct 3 ms 4444 KB Output is correct
28 Correct 3 ms 4696 KB Output is correct
29 Correct 25 ms 4956 KB Output is correct
30 Correct 26 ms 4816 KB Output is correct
31 Correct 25 ms 5016 KB Output is correct
32 Correct 24 ms 4952 KB Output is correct
33 Correct 24 ms 5040 KB Output is correct
34 Correct 30 ms 4952 KB Output is correct
35 Correct 24 ms 4956 KB Output is correct
36 Correct 38 ms 4952 KB Output is correct
37 Correct 28 ms 4956 KB Output is correct
38 Correct 24 ms 4952 KB Output is correct
39 Correct 26 ms 4956 KB Output is correct
40 Correct 25 ms 5012 KB Output is correct
41 Correct 25 ms 4956 KB Output is correct
42 Correct 11 ms 4696 KB Output is correct
43 Correct 434 ms 11416 KB Output is correct
44 Correct 788 ms 16380 KB Output is correct
45 Correct 728 ms 16348 KB Output is correct
46 Correct 796 ms 16864 KB Output is correct
47 Correct 798 ms 16808 KB Output is correct
48 Correct 796 ms 16872 KB Output is correct
49 Correct 847 ms 16868 KB Output is correct
50 Correct 756 ms 16436 KB Output is correct
51 Correct 792 ms 16384 KB Output is correct
52 Correct 778 ms 16864 KB Output is correct
53 Correct 783 ms 16864 KB Output is correct
54 Correct 857 ms 16604 KB Output is correct

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4696 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4564 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4696 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 2 ms 4444 KB Output is correct
19 Correct 3 ms 4564 KB Output is correct
20 Correct 2 ms 4440 KB Output is correct
21 Correct 2 ms 4444 KB Output is correct
22 Correct 3 ms 4444 KB Output is correct
23 Correct 3 ms 4440 KB Output is correct
24 Correct 3 ms 4440 KB Output is correct
25 Correct 4 ms 4440 KB Output is correct
26 Correct 3 ms 4444 KB Output is correct
27 Correct 3 ms 4444 KB Output is correct
28 Correct 3 ms 4696 KB Output is correct
29 Correct 25 ms 4956 KB Output is correct
30 Correct 26 ms 4816 KB Output is correct
31 Correct 25 ms 5016 KB Output is correct
32 Correct 24 ms 4952 KB Output is correct
33 Correct 24 ms 5040 KB Output is correct
34 Correct 30 ms 4952 KB Output is correct
35 Correct 24 ms 4956 KB Output is correct
36 Correct 38 ms 4952 KB Output is correct
37 Correct 28 ms 4956 KB Output is correct
38 Correct 24 ms 4952 KB Output is correct
39 Correct 26 ms 4956 KB Output is correct
40 Correct 25 ms 5012 KB Output is correct
41 Correct 25 ms 4956 KB Output is correct
42 Correct 11 ms 4696 KB Output is correct
43 Correct 434 ms 11416 KB Output is correct
44 Correct 788 ms 16380 KB Output is correct
45 Correct 728 ms 16348 KB Output is correct
46 Correct 796 ms 16864 KB Output is correct
47 Correct 798 ms 16808 KB Output is correct
48 Correct 796 ms 16872 KB Output is correct
49 Correct 847 ms 16868 KB Output is correct
50 Correct 756 ms 16436 KB Output is correct
51 Correct 792 ms 16384 KB Output is correct
52 Correct 778 ms 16864 KB Output is correct
53 Correct 783 ms 16864 KB Output is correct
54 Correct 857 ms 16604 KB Output is correct
55 Correct 6266 ms 73372 KB Output is correct
56 Execution timed out 7054 ms 103216 KB Time limit exceeded
57 Halted 0 ms 0 KB -