oj.uz

답안 #902502

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
902502 2024-01-10T13:49:16 Z Tuanlinh123 Chorus (JOI23_chorus) C++17
87 / 100
 7000 ms 818452 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=inf, b=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(long long x)
    {
        if (a==inf) return {inf*inf, idx};
        return {a*x+b, idx};
    }
};
 
struct Node
{
    Line A;
    ll l, r;
};
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(long long 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

# 결과 실행 시간 메모리 Grader output
1 Correct 312 ms 783100 KB Output is correct
2 Correct 287 ms 783200 KB Output is correct
3 Correct 273 ms 783164 KB Output is correct
4 Correct 270 ms 783168 KB Output is correct
5 Correct 296 ms 783012 KB Output is correct
6 Correct 279 ms 783064 KB Output is correct
7 Correct 271 ms 783428 KB Output is correct
8 Correct 271 ms 783172 KB Output is correct
9 Correct 258 ms 783140 KB Output is correct
10 Correct 251 ms 783032 KB Output is correct
11 Correct 250 ms 783188 KB Output is correct
12 Correct 240 ms 783192 KB Output is correct
13 Correct 264 ms 783220 KB Output is correct
14 Correct 245 ms 783104 KB Output is correct
15 Correct 254 ms 783488 KB Output is correct
16 Correct 234 ms 783188 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 312 ms 783100 KB Output is correct
2 Correct 287 ms 783200 KB Output is correct
3 Correct 273 ms 783164 KB Output is correct
4 Correct 270 ms 783168 KB Output is correct
5 Correct 296 ms 783012 KB Output is correct
6 Correct 279 ms 783064 KB Output is correct
7 Correct 271 ms 783428 KB Output is correct
8 Correct 271 ms 783172 KB Output is correct
9 Correct 258 ms 783140 KB Output is correct
10 Correct 251 ms 783032 KB Output is correct
11 Correct 250 ms 783188 KB Output is correct
12 Correct 240 ms 783192 KB Output is correct
13 Correct 264 ms 783220 KB Output is correct
14 Correct 245 ms 783104 KB Output is correct
15 Correct 254 ms 783488 KB Output is correct
16 Correct 234 ms 783188 KB Output is correct
17 Correct 239 ms 784312 KB Output is correct
18 Correct 245 ms 783188 KB Output is correct
19 Correct 273 ms 783024 KB Output is correct
20 Correct 251 ms 783188 KB Output is correct
21 Correct 234 ms 783228 KB Output is correct
22 Correct 229 ms 783208 KB Output is correct
23 Correct 235 ms 783440 KB Output is correct
24 Correct 231 ms 783024 KB Output is correct
25 Correct 230 ms 783188 KB Output is correct
26 Correct 258 ms 783016 KB Output is correct
27 Correct 262 ms 783124 KB Output is correct
28 Correct 248 ms 783564 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 312 ms 783100 KB Output is correct
2 Correct 287 ms 783200 KB Output is correct
3 Correct 273 ms 783164 KB Output is correct
4 Correct 270 ms 783168 KB Output is correct
5 Correct 296 ms 783012 KB Output is correct
6 Correct 279 ms 783064 KB Output is correct
7 Correct 271 ms 783428 KB Output is correct
8 Correct 271 ms 783172 KB Output is correct
9 Correct 258 ms 783140 KB Output is correct
10 Correct 251 ms 783032 KB Output is correct
11 Correct 250 ms 783188 KB Output is correct
12 Correct 240 ms 783192 KB Output is correct
13 Correct 264 ms 783220 KB Output is correct
14 Correct 245 ms 783104 KB Output is correct
15 Correct 254 ms 783488 KB Output is correct
16 Correct 234 ms 783188 KB Output is correct
17 Correct 239 ms 784312 KB Output is correct
18 Correct 245 ms 783188 KB Output is correct
19 Correct 273 ms 783024 KB Output is correct
20 Correct 251 ms 783188 KB Output is correct
21 Correct 234 ms 783228 KB Output is correct
22 Correct 229 ms 783208 KB Output is correct
23 Correct 235 ms 783440 KB Output is correct
24 Correct 231 ms 783024 KB Output is correct
25 Correct 230 ms 783188 KB Output is correct
26 Correct 258 ms 783016 KB Output is correct
27 Correct 262 ms 783124 KB Output is correct
28 Correct 248 ms 783564 KB Output is correct
29 Correct 253 ms 783352 KB Output is correct
30 Correct 271 ms 790652 KB Output is correct
31 Correct 274 ms 783428 KB Output is correct
32 Correct 262 ms 787540 KB Output is correct
33 Correct 253 ms 783188 KB Output is correct
34 Correct 269 ms 783432 KB Output is correct
35 Correct 283 ms 783464 KB Output is correct
36 Correct 274 ms 783432 KB Output is correct
37 Correct 269 ms 783360 KB Output is correct
38 Correct 245 ms 783256 KB Output is correct
39 Correct 246 ms 783188 KB Output is correct
40 Correct 240 ms 783348 KB Output is correct
41 Correct 237 ms 783184 KB Output is correct
42 Correct 214 ms 783260 KB Output is correct

Subtask #4
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 312 ms 783100 KB Output is correct
2 Correct 287 ms 783200 KB Output is correct
3 Correct 273 ms 783164 KB Output is correct
4 Correct 270 ms 783168 KB Output is correct
5 Correct 296 ms 783012 KB Output is correct
6 Correct 279 ms 783064 KB Output is correct
7 Correct 271 ms 783428 KB Output is correct
8 Correct 271 ms 783172 KB Output is correct
9 Correct 258 ms 783140 KB Output is correct
10 Correct 251 ms 783032 KB Output is correct
11 Correct 250 ms 783188 KB Output is correct
12 Correct 240 ms 783192 KB Output is correct
13 Correct 264 ms 783220 KB Output is correct
14 Correct 245 ms 783104 KB Output is correct
15 Correct 254 ms 783488 KB Output is correct
16 Correct 234 ms 783188 KB Output is correct
17 Correct 239 ms 784312 KB Output is correct
18 Correct 245 ms 783188 KB Output is correct
19 Correct 273 ms 783024 KB Output is correct
20 Correct 251 ms 783188 KB Output is correct
21 Correct 234 ms 783228 KB Output is correct
22 Correct 229 ms 783208 KB Output is correct
23 Correct 235 ms 783440 KB Output is correct
24 Correct 231 ms 783024 KB Output is correct
25 Correct 230 ms 783188 KB Output is correct
26 Correct 258 ms 783016 KB Output is correct
27 Correct 262 ms 783124 KB Output is correct
28 Correct 248 ms 783564 KB Output is correct
29 Correct 253 ms 783352 KB Output is correct
30 Correct 271 ms 790652 KB Output is correct
31 Correct 274 ms 783428 KB Output is correct
32 Correct 262 ms 787540 KB Output is correct
33 Correct 253 ms 783188 KB Output is correct
34 Correct 269 ms 783432 KB Output is correct
35 Correct 283 ms 783464 KB Output is correct
36 Correct 274 ms 783432 KB Output is correct
37 Correct 269 ms 783360 KB Output is correct
38 Correct 245 ms 783256 KB Output is correct
39 Correct 246 ms 783188 KB Output is correct
40 Correct 240 ms 783348 KB Output is correct
41 Correct 237 ms 783184 KB Output is correct
42 Correct 214 ms 783260 KB Output is correct
43 Correct 601 ms 785480 KB Output is correct
44 Correct 851 ms 786716 KB Output is correct
45 Correct 886 ms 786792 KB Output is correct
46 Correct 711 ms 786708 KB Output is correct
47 Correct 776 ms 786772 KB Output is correct
48 Correct 831 ms 786652 KB Output is correct
49 Correct 813 ms 786780 KB Output is correct
50 Correct 855 ms 786812 KB Output is correct
51 Correct 878 ms 786944 KB Output is correct
52 Correct 862 ms 786704 KB Output is correct
53 Correct 830 ms 786872 KB Output is correct
54 Correct 891 ms 786752 KB Output is correct

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 312 ms 783100 KB Output is correct
2 Correct 287 ms 783200 KB Output is correct
3 Correct 273 ms 783164 KB Output is correct
4 Correct 270 ms 783168 KB Output is correct
5 Correct 296 ms 783012 KB Output is correct
6 Correct 279 ms 783064 KB Output is correct
7 Correct 271 ms 783428 KB Output is correct
8 Correct 271 ms 783172 KB Output is correct
9 Correct 258 ms 783140 KB Output is correct
10 Correct 251 ms 783032 KB Output is correct
11 Correct 250 ms 783188 KB Output is correct
12 Correct 240 ms 783192 KB Output is correct
13 Correct 264 ms 783220 KB Output is correct
14 Correct 245 ms 783104 KB Output is correct
15 Correct 254 ms 783488 KB Output is correct
16 Correct 234 ms 783188 KB Output is correct
17 Correct 239 ms 784312 KB Output is correct
18 Correct 245 ms 783188 KB Output is correct
19 Correct 273 ms 783024 KB Output is correct
20 Correct 251 ms 783188 KB Output is correct
21 Correct 234 ms 783228 KB Output is correct
22 Correct 229 ms 783208 KB Output is correct
23 Correct 235 ms 783440 KB Output is correct
24 Correct 231 ms 783024 KB Output is correct
25 Correct 230 ms 783188 KB Output is correct
26 Correct 258 ms 783016 KB Output is correct
27 Correct 262 ms 783124 KB Output is correct
28 Correct 248 ms 783564 KB Output is correct
29 Correct 253 ms 783352 KB Output is correct
30 Correct 271 ms 790652 KB Output is correct
31 Correct 274 ms 783428 KB Output is correct
32 Correct 262 ms 787540 KB Output is correct
33 Correct 253 ms 783188 KB Output is correct
34 Correct 269 ms 783432 KB Output is correct
35 Correct 283 ms 783464 KB Output is correct
36 Correct 274 ms 783432 KB Output is correct
37 Correct 269 ms 783360 KB Output is correct
38 Correct 245 ms 783256 KB Output is correct
39 Correct 246 ms 783188 KB Output is correct
40 Correct 240 ms 783348 KB Output is correct
41 Correct 237 ms 783184 KB Output is correct
42 Correct 214 ms 783260 KB Output is correct
43 Correct 601 ms 785480 KB Output is correct
44 Correct 851 ms 786716 KB Output is correct
45 Correct 886 ms 786792 KB Output is correct
46 Correct 711 ms 786708 KB Output is correct
47 Correct 776 ms 786772 KB Output is correct
48 Correct 831 ms 786652 KB Output is correct
49 Correct 813 ms 786780 KB Output is correct
50 Correct 855 ms 786812 KB Output is correct
51 Correct 878 ms 786944 KB Output is correct
52 Correct 862 ms 786704 KB Output is correct
53 Correct 830 ms 786872 KB Output is correct
54 Correct 891 ms 786752 KB Output is correct
55 Correct 4993 ms 806108 KB Output is correct
56 Execution timed out 7061 ms 818452 KB Time limit exceeded
57 Halted 0 ms 0 KB -