oj.uz

Submission #950501

# Submission time Handle Problem Language Result Execution time Memory
950501 2024-03-20T11:21:14 Z andrei_boaca Chorus (JOI23_chorus) C++17
61 / 100
 7000 ms 6748 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
const ll INF=1e17;
ll n,k,lga,lgb,makegood;
ll A[1000005],B[1000005];
struct date
{
    ll val,l,r;
} dp[1000005];
string str;
date combine(date a, date b)
{
    if(a.val<b.val)
        return a;
    if(a.val>b.val)
        return b;
    a.l=min(a.l,b.l);
    a.r=max(a.r,b.r);
    return a;
}
void solve(ll cost)
{
    for(int i=n;i>=1;i--)
    {
        dp[i]={INF,0,0};
        ll suma=0;
        ll C=0;
        int ind=i;
        for(int j=i;j<=n;j++)
        {
            while(ind<=n&&B[ind]<A[j])
            {
                suma++;
                ind++;
            }
            C+=suma;
            date a=dp[j+1];
            a.val+=C+cost;
            a.l++;
            a.r++;
            dp[i]=combine(dp[i],a);
        }
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>k;
    cin>>str;
    for(int i=0;i<str.size();i++)
    {
        if(str[i]=='A')
            A[++lga]=i+1;
        else
            B[++lgb]=i+1;
    }
    for(int i=1;i<=n;i++)
        if(A[i]>B[i])
        {
            ll x=A[i];
            A[i]=B[i];
            for(int j=i;j<=n;j++)
            {
                if(B[j]<x)
                {
                    B[j]++;
                    makegood++;
                }
                else
                    break;
            }
        }
    /*for(int i=n;i>=1;i--)
    {
        dp[i][0]=INF;
        for(int cnt=1;cnt<=k;cnt++)
        {
            ll suma=0;
            ll cost=0;
            int ind=i;
            dp[i][cnt]=INF;
            for(int j=i;j<=n;j++)
            {
                while(ind<=n&&B[ind]<A[j])
                {
                    suma++;
                    ind++;
                }
                cost+=suma;
                dp[i][cnt]=min(dp[i][cnt],cost+dp[j+1][cnt-1]);
            }
        }
    }*/
    ll st=-2e12;
    ll dr=2e12;
    while(st<=dr)
    {
        ll mij=(st+dr)/2;
        solve(mij);
        if(dp[1].l<=k&&dp[1].r>=k)
        {
            ll rez=dp[1].val-mij*k;
            cout<<rez+makegood;
            return 0;
        }
        if(dp[1].l>k)
            st=mij+1;
        else
            dr=mij-1;
    }
    return 0;
}

Compilation message

chorus.cpp: In function 'int main()':
chorus.cpp:53:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |     for(int i=0;i<str.size();i++)
      |                 ~^~~~~~~~~~~

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 4444 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 4444 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 4444 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 4444 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 4444 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 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 17 ms 4576 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 9 ms 4444 KB Output is correct
22 Correct 12 ms 4576 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 14 ms 4576 KB Output is correct
25 Correct 1 ms 4440 KB Output is correct
26 Correct 13 ms 4576 KB Output is correct
27 Correct 11 ms 4444 KB Output is correct
28 Correct 16 ms 4444 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 4444 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 4444 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 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 17 ms 4576 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 9 ms 4444 KB Output is correct
22 Correct 12 ms 4576 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 14 ms 4576 KB Output is correct
25 Correct 1 ms 4440 KB Output is correct
26 Correct 13 ms 4576 KB Output is correct
27 Correct 11 ms 4444 KB Output is correct
28 Correct 16 ms 4444 KB Output is correct
29 Correct 1126 ms 4692 KB Output is correct
30 Correct 59 ms 4688 KB Output is correct
31 Correct 56 ms 4676 KB Output is correct
32 Correct 76 ms 4676 KB Output is correct
33 Correct 551 ms 4692 KB Output is correct
34 Correct 1132 ms 4696 KB Output is correct
35 Correct 35 ms 4680 KB Output is correct
36 Correct 1444 ms 4692 KB Output is correct
37 Correct 1798 ms 4696 KB Output is correct
38 Correct 1040 ms 4700 KB Output is correct
39 Correct 1505 ms 4696 KB Output is correct
40 Correct 1105 ms 4696 KB Output is correct
41 Correct 1084 ms 4700 KB Output is correct
42 Correct 991 ms 4696 KB Output is correct

Subtask #4
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 4444 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 4444 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 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 17 ms 4576 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 9 ms 4444 KB Output is correct
22 Correct 12 ms 4576 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 14 ms 4576 KB Output is correct
25 Correct 1 ms 4440 KB Output is correct
26 Correct 13 ms 4576 KB Output is correct
27 Correct 11 ms 4444 KB Output is correct
28 Correct 16 ms 4444 KB Output is correct
29 Correct 1126 ms 4692 KB Output is correct
30 Correct 59 ms 4688 KB Output is correct
31 Correct 56 ms 4676 KB Output is correct
32 Correct 76 ms 4676 KB Output is correct
33 Correct 551 ms 4692 KB Output is correct
34 Correct 1132 ms 4696 KB Output is correct
35 Correct 35 ms 4680 KB Output is correct
36 Correct 1444 ms 4692 KB Output is correct
37 Correct 1798 ms 4696 KB Output is correct
38 Correct 1040 ms 4700 KB Output is correct
39 Correct 1505 ms 4696 KB Output is correct
40 Correct 1105 ms 4696 KB Output is correct
41 Correct 1084 ms 4700 KB Output is correct
42 Correct 991 ms 4696 KB Output is correct
43 Execution timed out 7044 ms 6748 KB Time limit exceeded
44 Halted 0 ms 0 KB -

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 4444 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 4444 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 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 17 ms 4576 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 9 ms 4444 KB Output is correct
22 Correct 12 ms 4576 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 14 ms 4576 KB Output is correct
25 Correct 1 ms 4440 KB Output is correct
26 Correct 13 ms 4576 KB Output is correct
27 Correct 11 ms 4444 KB Output is correct
28 Correct 16 ms 4444 KB Output is correct
29 Correct 1126 ms 4692 KB Output is correct
30 Correct 59 ms 4688 KB Output is correct
31 Correct 56 ms 4676 KB Output is correct
32 Correct 76 ms 4676 KB Output is correct
33 Correct 551 ms 4692 KB Output is correct
34 Correct 1132 ms 4696 KB Output is correct
35 Correct 35 ms 4680 KB Output is correct
36 Correct 1444 ms 4692 KB Output is correct
37 Correct 1798 ms 4696 KB Output is correct
38 Correct 1040 ms 4700 KB Output is correct
39 Correct 1505 ms 4696 KB Output is correct
40 Correct 1105 ms 4696 KB Output is correct
41 Correct 1084 ms 4700 KB Output is correct
42 Correct 991 ms 4696 KB Output is correct
43 Execution timed out 7044 ms 6748 KB Time limit exceeded
44 Halted 0 ms 0 KB -