oj.uz

답안 #901750

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
901750 2024-01-10T01:52:07 Z Tuanlinh123 Chorus (JOI23_chorus) C++17
87 / 100
 5704 ms 1048576 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=2e9, maxn=1e6+5;
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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 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 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 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 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 3 ms 860 KB Output is correct
19 Correct 3 ms 856 KB Output is correct
20 Correct 3 ms 860 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 860 KB Output is correct
25 Correct 3 ms 1004 KB Output is correct
26 Correct 3 ms 860 KB Output is correct
27 Correct 3 ms 1004 KB Output is correct
28 Correct 3 ms 860 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 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 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 3 ms 860 KB Output is correct
19 Correct 3 ms 856 KB Output is correct
20 Correct 3 ms 860 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 860 KB Output is correct
25 Correct 3 ms 1004 KB Output is correct
26 Correct 3 ms 860 KB Output is correct
27 Correct 3 ms 1004 KB Output is correct
28 Correct 3 ms 860 KB Output is correct
29 Correct 34 ms 8400 KB Output is correct
30 Correct 35 ms 6996 KB Output is correct
31 Correct 34 ms 7004 KB Output is correct
32 Correct 30 ms 8976 KB Output is correct
33 Correct 33 ms 8284 KB Output is correct
34 Correct 34 ms 8796 KB Output is correct
35 Correct 33 ms 8760 KB Output is correct
36 Correct 39 ms 7192 KB Output is correct
37 Correct 36 ms 7804 KB Output is correct
38 Correct 33 ms 8796 KB Output is correct
39 Correct 35 ms 8020 KB Output is correct
40 Correct 34 ms 8028 KB Output is correct
41 Correct 34 ms 8156 KB Output is correct
42 Correct 15 ms 3420 KB Output is correct

Subtask #4
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 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 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 3 ms 860 KB Output is correct
19 Correct 3 ms 856 KB Output is correct
20 Correct 3 ms 860 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 860 KB Output is correct
25 Correct 3 ms 1004 KB Output is correct
26 Correct 3 ms 860 KB Output is correct
27 Correct 3 ms 1004 KB Output is correct
28 Correct 3 ms 860 KB Output is correct
29 Correct 34 ms 8400 KB Output is correct
30 Correct 35 ms 6996 KB Output is correct
31 Correct 34 ms 7004 KB Output is correct
32 Correct 30 ms 8976 KB Output is correct
33 Correct 33 ms 8284 KB Output is correct
34 Correct 34 ms 8796 KB Output is correct
35 Correct 33 ms 8760 KB Output is correct
36 Correct 39 ms 7192 KB Output is correct
37 Correct 36 ms 7804 KB Output is correct
38 Correct 33 ms 8796 KB Output is correct
39 Correct 35 ms 8020 KB Output is correct
40 Correct 34 ms 8028 KB Output is correct
41 Correct 34 ms 8156 KB Output is correct
42 Correct 15 ms 3420 KB Output is correct
43 Correct 542 ms 101524 KB Output is correct
44 Correct 925 ms 180752 KB Output is correct
45 Correct 914 ms 178132 KB Output is correct
46 Correct 829 ms 237612 KB Output is correct
47 Correct 844 ms 212696 KB Output is correct
48 Correct 904 ms 234284 KB Output is correct
49 Correct 966 ms 234168 KB Output is correct
50 Correct 949 ms 170980 KB Output is correct
51 Correct 1014 ms 168260 KB Output is correct
52 Correct 906 ms 234272 KB Output is correct
53 Correct 901 ms 234188 KB Output is correct
54 Correct 956 ms 185980 KB Output is correct

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 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 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 3 ms 860 KB Output is correct
19 Correct 3 ms 856 KB Output is correct
20 Correct 3 ms 860 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 860 KB Output is correct
25 Correct 3 ms 1004 KB Output is correct
26 Correct 3 ms 860 KB Output is correct
27 Correct 3 ms 1004 KB Output is correct
28 Correct 3 ms 860 KB Output is correct
29 Correct 34 ms 8400 KB Output is correct
30 Correct 35 ms 6996 KB Output is correct
31 Correct 34 ms 7004 KB Output is correct
32 Correct 30 ms 8976 KB Output is correct
33 Correct 33 ms 8284 KB Output is correct
34 Correct 34 ms 8796 KB Output is correct
35 Correct 33 ms 8760 KB Output is correct
36 Correct 39 ms 7192 KB Output is correct
37 Correct 36 ms 7804 KB Output is correct
38 Correct 33 ms 8796 KB Output is correct
39 Correct 35 ms 8020 KB Output is correct
40 Correct 34 ms 8028 KB Output is correct
41 Correct 34 ms 8156 KB Output is correct
42 Correct 15 ms 3420 KB Output is correct
43 Correct 542 ms 101524 KB Output is correct
44 Correct 925 ms 180752 KB Output is correct
45 Correct 914 ms 178132 KB Output is correct
46 Correct 829 ms 237612 KB Output is correct
47 Correct 844 ms 212696 KB Output is correct
48 Correct 904 ms 234284 KB Output is correct
49 Correct 966 ms 234168 KB Output is correct
50 Correct 949 ms 170980 KB Output is correct
51 Correct 1014 ms 168260 KB Output is correct
52 Correct 906 ms 234272 KB Output is correct
53 Correct 901 ms 234188 KB Output is correct
54 Correct 956 ms 185980 KB Output is correct
55 Runtime error 5704 ms 1048576 KB Execution killed with signal 9
56 Halted 0 ms 0 KB -