oj.uz

Submission #901725

# Submission time Handle Problem Language Result Execution time Memory
901725 2024-01-10T01:33:44 Z Tuanlinh123 Chorus (JOI23_chorus) C++17
87 / 100
 6259 ms 1048576 KB 
#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=2e9, maxn=1e6;
ll n, k, pre[maxn], to[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;
        // cout << A.a << " " << A.b << " " << A.idx << "add\n";
        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;
        }
        // cout << "end" << endl;
    }

    pll query(ll x)
    {
        // cout << x << endl;
        Node *i=root;
        ll Start=-inf, End=inf;
        pll ans={inf*inf, 0};
        while (1)
        {
            // cout << Start << " " << End << " " << i->A.a << " " << i->A.b << endl;
            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;
    }
};

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)
{
    // cout << C << endl;
    ll crr=1;
    Lichao A; A.addline(Line(0, -pre[to[0]-1], 0));
    vector <ll> dp(n+1, inf*inf), cnt(n+1, 0); dp[0]=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;
        // cout << i << " " << dp[i] << " " << cnt[i] << "\n";
    }
    // cout << C << " " << dp[n] << " " << cnt[n] << "\n";
    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 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 464 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 464 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 464 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 464 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 5 ms 860 KB Output is correct
19 Correct 4 ms 860 KB Output is correct
20 Correct 3 ms 856 KB Output is correct
21 Correct 3 ms 860 KB Output is correct
22 Correct 3 ms 856 KB Output is correct
23 Correct 3 ms 860 KB Output is correct
24 Correct 3 ms 904 KB Output is correct
25 Correct 5 ms 860 KB Output is correct
26 Correct 3 ms 860 KB Output is correct
27 Correct 3 ms 1112 KB Output is correct
28 Correct 3 ms 860 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 464 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 464 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 5 ms 860 KB Output is correct
19 Correct 4 ms 860 KB Output is correct
20 Correct 3 ms 856 KB Output is correct
21 Correct 3 ms 860 KB Output is correct
22 Correct 3 ms 856 KB Output is correct
23 Correct 3 ms 860 KB Output is correct
24 Correct 3 ms 904 KB Output is correct
25 Correct 5 ms 860 KB Output is correct
26 Correct 3 ms 860 KB Output is correct
27 Correct 3 ms 1112 KB Output is correct
28 Correct 3 ms 860 KB Output is correct
29 Correct 35 ms 8276 KB Output is correct
30 Correct 36 ms 7260 KB Output is correct
31 Correct 36 ms 6996 KB Output is correct
32 Correct 37 ms 9464 KB Output is correct
33 Correct 35 ms 8272 KB Output is correct
34 Correct 35 ms 8796 KB Output is correct
35 Correct 35 ms 8784 KB Output is correct
36 Correct 36 ms 6960 KB Output is correct
37 Correct 42 ms 7788 KB Output is correct
38 Correct 35 ms 8888 KB Output is correct
39 Correct 46 ms 8264 KB Output is correct
40 Correct 35 ms 8028 KB Output is correct
41 Correct 35 ms 8140 KB Output is correct
42 Correct 18 ms 3324 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 464 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 464 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 5 ms 860 KB Output is correct
19 Correct 4 ms 860 KB Output is correct
20 Correct 3 ms 856 KB Output is correct
21 Correct 3 ms 860 KB Output is correct
22 Correct 3 ms 856 KB Output is correct
23 Correct 3 ms 860 KB Output is correct
24 Correct 3 ms 904 KB Output is correct
25 Correct 5 ms 860 KB Output is correct
26 Correct 3 ms 860 KB Output is correct
27 Correct 3 ms 1112 KB Output is correct
28 Correct 3 ms 860 KB Output is correct
29 Correct 35 ms 8276 KB Output is correct
30 Correct 36 ms 7260 KB Output is correct
31 Correct 36 ms 6996 KB Output is correct
32 Correct 37 ms 9464 KB Output is correct
33 Correct 35 ms 8272 KB Output is correct
34 Correct 35 ms 8796 KB Output is correct
35 Correct 35 ms 8784 KB Output is correct
36 Correct 36 ms 6960 KB Output is correct
37 Correct 42 ms 7788 KB Output is correct
38 Correct 35 ms 8888 KB Output is correct
39 Correct 46 ms 8264 KB Output is correct
40 Correct 35 ms 8028 KB Output is correct
41 Correct 35 ms 8140 KB Output is correct
42 Correct 18 ms 3324 KB Output is correct
43 Correct 543 ms 101548 KB Output is correct
44 Correct 983 ms 180844 KB Output is correct
45 Correct 981 ms 178716 KB Output is correct
46 Correct 915 ms 238148 KB Output is correct
47 Correct 905 ms 212972 KB Output is correct
48 Correct 965 ms 234376 KB Output is correct
49 Correct 930 ms 234352 KB Output is correct
50 Correct 951 ms 171336 KB Output is correct
51 Correct 958 ms 168632 KB Output is correct
52 Correct 934 ms 234248 KB Output is correct
53 Correct 946 ms 234368 KB Output is correct
54 Correct 1002 ms 186032 KB Output is correct

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 464 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 464 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 5 ms 860 KB Output is correct
19 Correct 4 ms 860 KB Output is correct
20 Correct 3 ms 856 KB Output is correct
21 Correct 3 ms 860 KB Output is correct
22 Correct 3 ms 856 KB Output is correct
23 Correct 3 ms 860 KB Output is correct
24 Correct 3 ms 904 KB Output is correct
25 Correct 5 ms 860 KB Output is correct
26 Correct 3 ms 860 KB Output is correct
27 Correct 3 ms 1112 KB Output is correct
28 Correct 3 ms 860 KB Output is correct
29 Correct 35 ms 8276 KB Output is correct
30 Correct 36 ms 7260 KB Output is correct
31 Correct 36 ms 6996 KB Output is correct
32 Correct 37 ms 9464 KB Output is correct
33 Correct 35 ms 8272 KB Output is correct
34 Correct 35 ms 8796 KB Output is correct
35 Correct 35 ms 8784 KB Output is correct
36 Correct 36 ms 6960 KB Output is correct
37 Correct 42 ms 7788 KB Output is correct
38 Correct 35 ms 8888 KB Output is correct
39 Correct 46 ms 8264 KB Output is correct
40 Correct 35 ms 8028 KB Output is correct
41 Correct 35 ms 8140 KB Output is correct
42 Correct 18 ms 3324 KB Output is correct
43 Correct 543 ms 101548 KB Output is correct
44 Correct 983 ms 180844 KB Output is correct
45 Correct 981 ms 178716 KB Output is correct
46 Correct 915 ms 238148 KB Output is correct
47 Correct 905 ms 212972 KB Output is correct
48 Correct 965 ms 234376 KB Output is correct
49 Correct 930 ms 234352 KB Output is correct
50 Correct 951 ms 171336 KB Output is correct
51 Correct 958 ms 168632 KB Output is correct
52 Correct 934 ms 234248 KB Output is correct
53 Correct 946 ms 234368 KB Output is correct
54 Correct 1002 ms 186032 KB Output is correct
55 Runtime error 6259 ms 1048576 KB Execution killed with signal 9
56 Halted 0 ms 0 KB -