oj.uz

답안 #901748

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
901748 2024-01-10T01:50:24 Z Tuanlinh123 Chorus (JOI23_chorus) C++17
87 / 100
 5986 ms 1048576 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,popcnt,lzcnt")
#include<bits/stdc++.h>
#define ll int
#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=2e9, maxn=1e6+5;
long long n, k, to[maxn];
long long 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){}
    pair<long long, ll> 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;
        }
    }

    pair<long long, ll> query(ll 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;
    }
};

pair<long long, ll> solve(long long C)
{
    ll crr=1;
    Lichao A; A.addline(Line(0, -pre[to[0]-1], 0));
    vector <long long> dp(n+1, inf*inf); dp[0]=0;
    vector <ll> cnt(n+1, 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;
    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-k*lo;
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 3 ms 2908 KB Output is correct
19 Correct 3 ms 2908 KB Output is correct
20 Correct 3 ms 2904 KB Output is correct
21 Correct 3 ms 2908 KB Output is correct
22 Correct 3 ms 2908 KB Output is correct
23 Correct 3 ms 2908 KB Output is correct
24 Correct 3 ms 2908 KB Output is correct
25 Correct 3 ms 2908 KB Output is correct
26 Correct 3 ms 2908 KB Output is correct
27 Correct 3 ms 2908 KB Output is correct
28 Correct 3 ms 2908 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 3 ms 2908 KB Output is correct
19 Correct 3 ms 2908 KB Output is correct
20 Correct 3 ms 2904 KB Output is correct
21 Correct 3 ms 2908 KB Output is correct
22 Correct 3 ms 2908 KB Output is correct
23 Correct 3 ms 2908 KB Output is correct
24 Correct 3 ms 2908 KB Output is correct
25 Correct 3 ms 2908 KB Output is correct
26 Correct 3 ms 2908 KB Output is correct
27 Correct 3 ms 2908 KB Output is correct
28 Correct 3 ms 2908 KB Output is correct
29 Correct 35 ms 10332 KB Output is correct
30 Correct 36 ms 9048 KB Output is correct
31 Correct 36 ms 9152 KB Output is correct
32 Correct 32 ms 10928 KB Output is correct
33 Correct 35 ms 10384 KB Output is correct
34 Correct 35 ms 10828 KB Output is correct
35 Correct 35 ms 10832 KB Output is correct
36 Correct 38 ms 8784 KB Output is correct
37 Correct 38 ms 9880 KB Output is correct
38 Correct 35 ms 10836 KB Output is correct
39 Correct 37 ms 10156 KB Output is correct
40 Correct 38 ms 10072 KB Output is correct
41 Correct 39 ms 9992 KB Output is correct
42 Correct 17 ms 5212 KB Output is correct

Subtask #4
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 3 ms 2908 KB Output is correct
19 Correct 3 ms 2908 KB Output is correct
20 Correct 3 ms 2904 KB Output is correct
21 Correct 3 ms 2908 KB Output is correct
22 Correct 3 ms 2908 KB Output is correct
23 Correct 3 ms 2908 KB Output is correct
24 Correct 3 ms 2908 KB Output is correct
25 Correct 3 ms 2908 KB Output is correct
26 Correct 3 ms 2908 KB Output is correct
27 Correct 3 ms 2908 KB Output is correct
28 Correct 3 ms 2908 KB Output is correct
29 Correct 35 ms 10332 KB Output is correct
30 Correct 36 ms 9048 KB Output is correct
31 Correct 36 ms 9152 KB Output is correct
32 Correct 32 ms 10928 KB Output is correct
33 Correct 35 ms 10384 KB Output is correct
34 Correct 35 ms 10828 KB Output is correct
35 Correct 35 ms 10832 KB Output is correct
36 Correct 38 ms 8784 KB Output is correct
37 Correct 38 ms 9880 KB Output is correct
38 Correct 35 ms 10836 KB Output is correct
39 Correct 37 ms 10156 KB Output is correct
40 Correct 38 ms 10072 KB Output is correct
41 Correct 39 ms 9992 KB Output is correct
42 Correct 17 ms 5212 KB Output is correct
43 Correct 559 ms 102724 KB Output is correct
44 Correct 986 ms 181916 KB Output is correct
45 Correct 967 ms 179344 KB Output is correct
46 Correct 888 ms 238948 KB Output is correct
47 Correct 885 ms 213832 KB Output is correct
48 Correct 964 ms 235680 KB Output is correct
49 Correct 951 ms 235508 KB Output is correct
50 Correct 982 ms 172200 KB Output is correct
51 Correct 1012 ms 169268 KB Output is correct
52 Correct 982 ms 235380 KB Output is correct
53 Correct 981 ms 235348 KB Output is correct
54 Correct 1026 ms 187072 KB Output is correct

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 3 ms 2908 KB Output is correct
19 Correct 3 ms 2908 KB Output is correct
20 Correct 3 ms 2904 KB Output is correct
21 Correct 3 ms 2908 KB Output is correct
22 Correct 3 ms 2908 KB Output is correct
23 Correct 3 ms 2908 KB Output is correct
24 Correct 3 ms 2908 KB Output is correct
25 Correct 3 ms 2908 KB Output is correct
26 Correct 3 ms 2908 KB Output is correct
27 Correct 3 ms 2908 KB Output is correct
28 Correct 3 ms 2908 KB Output is correct
29 Correct 35 ms 10332 KB Output is correct
30 Correct 36 ms 9048 KB Output is correct
31 Correct 36 ms 9152 KB Output is correct
32 Correct 32 ms 10928 KB Output is correct
33 Correct 35 ms 10384 KB Output is correct
34 Correct 35 ms 10828 KB Output is correct
35 Correct 35 ms 10832 KB Output is correct
36 Correct 38 ms 8784 KB Output is correct
37 Correct 38 ms 9880 KB Output is correct
38 Correct 35 ms 10836 KB Output is correct
39 Correct 37 ms 10156 KB Output is correct
40 Correct 38 ms 10072 KB Output is correct
41 Correct 39 ms 9992 KB Output is correct
42 Correct 17 ms 5212 KB Output is correct
43 Correct 559 ms 102724 KB Output is correct
44 Correct 986 ms 181916 KB Output is correct
45 Correct 967 ms 179344 KB Output is correct
46 Correct 888 ms 238948 KB Output is correct
47 Correct 885 ms 213832 KB Output is correct
48 Correct 964 ms 235680 KB Output is correct
49 Correct 951 ms 235508 KB Output is correct
50 Correct 982 ms 172200 KB Output is correct
51 Correct 1012 ms 169268 KB Output is correct
52 Correct 982 ms 235380 KB Output is correct
53 Correct 981 ms 235348 KB Output is correct
54 Correct 1026 ms 187072 KB Output is correct
55 Runtime error 5986 ms 1048576 KB Execution killed with signal 9
56 Halted 0 ms 0 KB -