oj.uz

Submission #902508

# Submission time Handle Problem Language Result Execution time Memory
902508 2024-01-10T13:58:28 Z Tuanlinh123 Chorus (JOI23_chorus) C++17
87 / 100
 7000 ms 818372 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=1e6, maxn=1e6+5;
ll cnt[maxn], to[maxn];
long long n, k, dp[maxn], pre[maxn];
 
struct Line
{
    long long a=0, b=inf*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(ll 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=-inf, 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(ll x)
    {
        ll Start=-inf, 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 783052 KB Output is correct
2 Correct 195 ms 783184 KB Output is correct
3 Correct 193 ms 783172 KB Output is correct
4 Correct 211 ms 783128 KB Output is correct
5 Correct 204 ms 783188 KB Output is correct
6 Correct 212 ms 783184 KB Output is correct
7 Correct 194 ms 783188 KB Output is correct
8 Correct 184 ms 783180 KB Output is correct
9 Correct 212 ms 783012 KB Output is correct
10 Correct 195 ms 783132 KB Output is correct
11 Correct 193 ms 783196 KB Output is correct
12 Correct 221 ms 782996 KB Output is correct
13 Correct 191 ms 783212 KB Output is correct
14 Correct 204 ms 783180 KB Output is correct
15 Correct 190 ms 783240 KB Output is correct
16 Correct 187 ms 783184 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 276 ms 783052 KB Output is correct
2 Correct 195 ms 783184 KB Output is correct
3 Correct 193 ms 783172 KB Output is correct
4 Correct 211 ms 783128 KB Output is correct
5 Correct 204 ms 783188 KB Output is correct
6 Correct 212 ms 783184 KB Output is correct
7 Correct 194 ms 783188 KB Output is correct
8 Correct 184 ms 783180 KB Output is correct
9 Correct 212 ms 783012 KB Output is correct
10 Correct 195 ms 783132 KB Output is correct
11 Correct 193 ms 783196 KB Output is correct
12 Correct 221 ms 782996 KB Output is correct
13 Correct 191 ms 783212 KB Output is correct
14 Correct 204 ms 783180 KB Output is correct
15 Correct 190 ms 783240 KB Output is correct
16 Correct 187 ms 783184 KB Output is correct
17 Correct 191 ms 783184 KB Output is correct
18 Correct 198 ms 783236 KB Output is correct
19 Correct 197 ms 783040 KB Output is correct
20 Correct 215 ms 783200 KB Output is correct
21 Correct 192 ms 783208 KB Output is correct
22 Correct 190 ms 783036 KB Output is correct
23 Correct 197 ms 783184 KB Output is correct
24 Correct 186 ms 783440 KB Output is correct
25 Correct 190 ms 783188 KB Output is correct
26 Correct 191 ms 783116 KB Output is correct
27 Correct 189 ms 783032 KB Output is correct
28 Correct 218 ms 783232 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 276 ms 783052 KB Output is correct
2 Correct 195 ms 783184 KB Output is correct
3 Correct 193 ms 783172 KB Output is correct
4 Correct 211 ms 783128 KB Output is correct
5 Correct 204 ms 783188 KB Output is correct
6 Correct 212 ms 783184 KB Output is correct
7 Correct 194 ms 783188 KB Output is correct
8 Correct 184 ms 783180 KB Output is correct
9 Correct 212 ms 783012 KB Output is correct
10 Correct 195 ms 783132 KB Output is correct
11 Correct 193 ms 783196 KB Output is correct
12 Correct 221 ms 782996 KB Output is correct
13 Correct 191 ms 783212 KB Output is correct
14 Correct 204 ms 783180 KB Output is correct
15 Correct 190 ms 783240 KB Output is correct
16 Correct 187 ms 783184 KB Output is correct
17 Correct 191 ms 783184 KB Output is correct
18 Correct 198 ms 783236 KB Output is correct
19 Correct 197 ms 783040 KB Output is correct
20 Correct 215 ms 783200 KB Output is correct
21 Correct 192 ms 783208 KB Output is correct
22 Correct 190 ms 783036 KB Output is correct
23 Correct 197 ms 783184 KB Output is correct
24 Correct 186 ms 783440 KB Output is correct
25 Correct 190 ms 783188 KB Output is correct
26 Correct 191 ms 783116 KB Output is correct
27 Correct 189 ms 783032 KB Output is correct
28 Correct 218 ms 783232 KB Output is correct
29 Correct 216 ms 783384 KB Output is correct
30 Correct 208 ms 783412 KB Output is correct
31 Correct 204 ms 783412 KB Output is correct
32 Correct 225 ms 783272 KB Output is correct
33 Correct 229 ms 783328 KB Output is correct
34 Correct 217 ms 783192 KB Output is correct
35 Correct 209 ms 783360 KB Output is correct
36 Correct 238 ms 783484 KB Output is correct
37 Correct 204 ms 783208 KB Output is correct
38 Correct 205 ms 783184 KB Output is correct
39 Correct 233 ms 783224 KB Output is correct
40 Correct 223 ms 783200 KB Output is correct
41 Correct 219 ms 783272 KB Output is correct
42 Correct 200 ms 783392 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 276 ms 783052 KB Output is correct
2 Correct 195 ms 783184 KB Output is correct
3 Correct 193 ms 783172 KB Output is correct
4 Correct 211 ms 783128 KB Output is correct
5 Correct 204 ms 783188 KB Output is correct
6 Correct 212 ms 783184 KB Output is correct
7 Correct 194 ms 783188 KB Output is correct
8 Correct 184 ms 783180 KB Output is correct
9 Correct 212 ms 783012 KB Output is correct
10 Correct 195 ms 783132 KB Output is correct
11 Correct 193 ms 783196 KB Output is correct
12 Correct 221 ms 782996 KB Output is correct
13 Correct 191 ms 783212 KB Output is correct
14 Correct 204 ms 783180 KB Output is correct
15 Correct 190 ms 783240 KB Output is correct
16 Correct 187 ms 783184 KB Output is correct
17 Correct 191 ms 783184 KB Output is correct
18 Correct 198 ms 783236 KB Output is correct
19 Correct 197 ms 783040 KB Output is correct
20 Correct 215 ms 783200 KB Output is correct
21 Correct 192 ms 783208 KB Output is correct
22 Correct 190 ms 783036 KB Output is correct
23 Correct 197 ms 783184 KB Output is correct
24 Correct 186 ms 783440 KB Output is correct
25 Correct 190 ms 783188 KB Output is correct
26 Correct 191 ms 783116 KB Output is correct
27 Correct 189 ms 783032 KB Output is correct
28 Correct 218 ms 783232 KB Output is correct
29 Correct 216 ms 783384 KB Output is correct
30 Correct 208 ms 783412 KB Output is correct
31 Correct 204 ms 783412 KB Output is correct
32 Correct 225 ms 783272 KB Output is correct
33 Correct 229 ms 783328 KB Output is correct
34 Correct 217 ms 783192 KB Output is correct
35 Correct 209 ms 783360 KB Output is correct
36 Correct 238 ms 783484 KB Output is correct
37 Correct 204 ms 783208 KB Output is correct
38 Correct 205 ms 783184 KB Output is correct
39 Correct 233 ms 783224 KB Output is correct
40 Correct 223 ms 783200 KB Output is correct
41 Correct 219 ms 783272 KB Output is correct
42 Correct 200 ms 783392 KB Output is correct
43 Correct 566 ms 785232 KB Output is correct
44 Correct 914 ms 786820 KB Output is correct
45 Correct 866 ms 786764 KB Output is correct
46 Correct 809 ms 786768 KB Output is correct
47 Correct 816 ms 786812 KB Output is correct
48 Correct 932 ms 786948 KB Output is correct
49 Correct 856 ms 786828 KB Output is correct
50 Correct 905 ms 786700 KB Output is correct
51 Correct 901 ms 786812 KB Output is correct
52 Correct 865 ms 786708 KB Output is correct
53 Correct 869 ms 786712 KB Output is correct
54 Correct 896 ms 786816 KB Output is correct

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 276 ms 783052 KB Output is correct
2 Correct 195 ms 783184 KB Output is correct
3 Correct 193 ms 783172 KB Output is correct
4 Correct 211 ms 783128 KB Output is correct
5 Correct 204 ms 783188 KB Output is correct
6 Correct 212 ms 783184 KB Output is correct
7 Correct 194 ms 783188 KB Output is correct
8 Correct 184 ms 783180 KB Output is correct
9 Correct 212 ms 783012 KB Output is correct
10 Correct 195 ms 783132 KB Output is correct
11 Correct 193 ms 783196 KB Output is correct
12 Correct 221 ms 782996 KB Output is correct
13 Correct 191 ms 783212 KB Output is correct
14 Correct 204 ms 783180 KB Output is correct
15 Correct 190 ms 783240 KB Output is correct
16 Correct 187 ms 783184 KB Output is correct
17 Correct 191 ms 783184 KB Output is correct
18 Correct 198 ms 783236 KB Output is correct
19 Correct 197 ms 783040 KB Output is correct
20 Correct 215 ms 783200 KB Output is correct
21 Correct 192 ms 783208 KB Output is correct
22 Correct 190 ms 783036 KB Output is correct
23 Correct 197 ms 783184 KB Output is correct
24 Correct 186 ms 783440 KB Output is correct
25 Correct 190 ms 783188 KB Output is correct
26 Correct 191 ms 783116 KB Output is correct
27 Correct 189 ms 783032 KB Output is correct
28 Correct 218 ms 783232 KB Output is correct
29 Correct 216 ms 783384 KB Output is correct
30 Correct 208 ms 783412 KB Output is correct
31 Correct 204 ms 783412 KB Output is correct
32 Correct 225 ms 783272 KB Output is correct
33 Correct 229 ms 783328 KB Output is correct
34 Correct 217 ms 783192 KB Output is correct
35 Correct 209 ms 783360 KB Output is correct
36 Correct 238 ms 783484 KB Output is correct
37 Correct 204 ms 783208 KB Output is correct
38 Correct 205 ms 783184 KB Output is correct
39 Correct 233 ms 783224 KB Output is correct
40 Correct 223 ms 783200 KB Output is correct
41 Correct 219 ms 783272 KB Output is correct
42 Correct 200 ms 783392 KB Output is correct
43 Correct 566 ms 785232 KB Output is correct
44 Correct 914 ms 786820 KB Output is correct
45 Correct 866 ms 786764 KB Output is correct
46 Correct 809 ms 786768 KB Output is correct
47 Correct 816 ms 786812 KB Output is correct
48 Correct 932 ms 786948 KB Output is correct
49 Correct 856 ms 786828 KB Output is correct
50 Correct 905 ms 786700 KB Output is correct
51 Correct 901 ms 786812 KB Output is correct
52 Correct 865 ms 786708 KB Output is correct
53 Correct 869 ms 786712 KB Output is correct
54 Correct 896 ms 786816 KB Output is correct
55 Correct 5308 ms 805872 KB Output is correct
56 Execution timed out 7084 ms 818372 KB Time limit exceeded
57 Halted 0 ms 0 KB -