oj.uz

Submission #868517

# Submission time Handle Problem Language Result Execution time Memory
868517 2023-10-31T15:48:50 Z chonka Chorus (JOI23_chorus) C++17
87 / 100
 5321 ms 46504 KB 
#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ;
typedef vector < int > vi ;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

const int MAXN = 1e6 + 7 ;

int n , k ;
int a[ MAXN ] , b[ MAXN ] ;
int lw[ MAXN ] , ori[ MAXN ] ;
ll pref[ MAXN ] ;

inline ll calc ( int l , int r ) {
    if ( l > r ) { return 0 ; }
    if ( r <= ori[ l ] ) { return 0 ; }
    int aux_st = max ( ori[ l ] , l - 1 ) ;
    return ( pref[ r ] - pref[ aux_st ] ) - 1LL * ( r - aux_st ) * ( l - 1 ) ;
}

ll dp[ MAXN ] ;
int ctr[ MAXN ] ;


inline int get_fst ( int x , int y ) {
    int l , r , mid ;
    l = max ( x , y ) , r = n ;
    if ( make_pair ( dp[ x ] + calc ( x + 1 , n ) , ctr[ x ] ) < make_pair ( dp[ y ] + calc ( y + 1 , n ) , ctr[ y ] ) ) { return n + 1 ; }
    while ( l < r ) {
        mid = ( l + r ) / 2 ;
        if ( make_pair ( dp[ x ] + calc ( x + 1 , mid ) , ctr[ x ] ) < make_pair ( dp[ y ] + calc ( y + 1 , mid ) , ctr[ y ] ) ) { l = mid + 1 ; }
        else { r = mid ; }
    }
    return l ;
}

int ord[ MAXN ] ;
int nxt[ MAXN ] ;

pair < ll , int > f ( ll sr ) {
    int lo = 1 , hi = 1 ;
    ord[ lo ] = 0 ;
    int sz = 1 ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        while ( sz >= 2 && nxt[ lo ] <= i ) {
            ++ lo , -- sz ;
        }
        int x = ord[ lo ] ;
        dp[ i ] = dp[ x ] + calc ( x + 1 , i ) + sr ;
        ctr[ i ] = ctr[ x ] + 1 ;

        while ( sz >= 2 && nxt[ hi - 1 ] >= ( nxt[ hi ] = get_fst ( ord[ hi ] , i ) ) ) { 
            -- hi , -- sz ;
        }
        if ( sz == 1 ) { nxt[ hi ] = get_fst ( ord[ hi ] , i ) ; }
        ord[ ++ hi ] = i ;
        ++ sz ;
    }
    return { dp[ n ] , ctr[ n ] } ;
}

void solve ( ) {
    cin >> n >> k ;
    string s ; cin >> s ;
    int pos1 = 0 , pos2 = 0 ;
    for ( int i = 1 ; i <= 2 * n ; ++ i ) {
        if ( s[ i - 1 ] == 'A' ) { a[ ++ pos1 ] = i ; }
        else { b[ ++ pos2 ] = i ; }
    }
    int tp = 0 ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        while ( tp < n && b[ tp + 1 ] < a[ i ] ) { ++ tp ; }
        lw[ i ] = tp ;
        pref[ i ] = pref[ i - 1 ] + lw[ i ] ;
    }
    pref[ n + 1 ] = pref[ n ] ;
    tp = 0 ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        while ( tp < n && lw[ tp + 1 ] < i ) { ++ tp ; }
        ori[ i ] = tp ;
    }
    ll l , r , mid ;
    l = -1 , r = ( 1LL << 32 ) ;
    while ( l < r ) {
        mid = ( l + r ) / 2 ;
        auto [ ret , cnt ] = f ( mid ) ;
        if ( cnt > k ) { l = mid + 1 ; }
        else { 
            if ( mid == r ) { break ; }
            r = mid ;
        }
    }
    auto [ ret , cnt ] = f ( r ) ;
    cout << ret - k * r << "\n" ;
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; // cin >> t ;
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 1 ms 10588 KB Output is correct
7 Correct 1 ms 10588 KB Output is correct
8 Correct 1 ms 10588 KB Output is correct
9 Correct 1 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct
11 Correct 1 ms 10584 KB Output is correct
12 Correct 1 ms 10588 KB Output is correct
13 Correct 2 ms 10588 KB Output is correct
14 Correct 2 ms 10588 KB Output is correct
15 Correct 2 ms 10588 KB Output is correct
16 Correct 1 ms 10588 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 1 ms 10588 KB Output is correct
7 Correct 1 ms 10588 KB Output is correct
8 Correct 1 ms 10588 KB Output is correct
9 Correct 1 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct
11 Correct 1 ms 10584 KB Output is correct
12 Correct 1 ms 10588 KB Output is correct
13 Correct 2 ms 10588 KB Output is correct
14 Correct 2 ms 10588 KB Output is correct
15 Correct 2 ms 10588 KB Output is correct
16 Correct 1 ms 10588 KB Output is correct
17 Correct 2 ms 10588 KB Output is correct
18 Correct 2 ms 10752 KB Output is correct
19 Correct 2 ms 10840 KB Output is correct
20 Correct 2 ms 10588 KB Output is correct
21 Correct 2 ms 10708 KB Output is correct
22 Correct 2 ms 10588 KB Output is correct
23 Correct 2 ms 10588 KB Output is correct
24 Correct 2 ms 10588 KB Output is correct
25 Correct 2 ms 10588 KB Output is correct
26 Correct 2 ms 10588 KB Output is correct
27 Correct 2 ms 10588 KB Output is correct
28 Correct 2 ms 10584 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 1 ms 10588 KB Output is correct
7 Correct 1 ms 10588 KB Output is correct
8 Correct 1 ms 10588 KB Output is correct
9 Correct 1 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct
11 Correct 1 ms 10584 KB Output is correct
12 Correct 1 ms 10588 KB Output is correct
13 Correct 2 ms 10588 KB Output is correct
14 Correct 2 ms 10588 KB Output is correct
15 Correct 2 ms 10588 KB Output is correct
16 Correct 1 ms 10588 KB Output is correct
17 Correct 2 ms 10588 KB Output is correct
18 Correct 2 ms 10752 KB Output is correct
19 Correct 2 ms 10840 KB Output is correct
20 Correct 2 ms 10588 KB Output is correct
21 Correct 2 ms 10708 KB Output is correct
22 Correct 2 ms 10588 KB Output is correct
23 Correct 2 ms 10588 KB Output is correct
24 Correct 2 ms 10588 KB Output is correct
25 Correct 2 ms 10588 KB Output is correct
26 Correct 2 ms 10588 KB Output is correct
27 Correct 2 ms 10588 KB Output is correct
28 Correct 2 ms 10584 KB Output is correct
29 Correct 13 ms 11096 KB Output is correct
30 Correct 18 ms 10844 KB Output is correct
31 Correct 21 ms 11100 KB Output is correct
32 Correct 11 ms 10844 KB Output is correct
33 Correct 13 ms 10840 KB Output is correct
34 Correct 12 ms 10844 KB Output is correct
35 Correct 12 ms 10844 KB Output is correct
36 Correct 17 ms 10876 KB Output is correct
37 Correct 18 ms 10872 KB Output is correct
38 Correct 12 ms 10844 KB Output is correct
39 Correct 15 ms 10844 KB Output is correct
40 Correct 15 ms 10844 KB Output is correct
41 Correct 15 ms 10844 KB Output is correct
42 Correct 10 ms 10844 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 1 ms 10588 KB Output is correct
7 Correct 1 ms 10588 KB Output is correct
8 Correct 1 ms 10588 KB Output is correct
9 Correct 1 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct
11 Correct 1 ms 10584 KB Output is correct
12 Correct 1 ms 10588 KB Output is correct
13 Correct 2 ms 10588 KB Output is correct
14 Correct 2 ms 10588 KB Output is correct
15 Correct 2 ms 10588 KB Output is correct
16 Correct 1 ms 10588 KB Output is correct
17 Correct 2 ms 10588 KB Output is correct
18 Correct 2 ms 10752 KB Output is correct
19 Correct 2 ms 10840 KB Output is correct
20 Correct 2 ms 10588 KB Output is correct
21 Correct 2 ms 10708 KB Output is correct
22 Correct 2 ms 10588 KB Output is correct
23 Correct 2 ms 10588 KB Output is correct
24 Correct 2 ms 10588 KB Output is correct
25 Correct 2 ms 10588 KB Output is correct
26 Correct 2 ms 10588 KB Output is correct
27 Correct 2 ms 10588 KB Output is correct
28 Correct 2 ms 10584 KB Output is correct
29 Correct 13 ms 11096 KB Output is correct
30 Correct 18 ms 10844 KB Output is correct
31 Correct 21 ms 11100 KB Output is correct
32 Correct 11 ms 10844 KB Output is correct
33 Correct 13 ms 10840 KB Output is correct
34 Correct 12 ms 10844 KB Output is correct
35 Correct 12 ms 10844 KB Output is correct
36 Correct 17 ms 10876 KB Output is correct
37 Correct 18 ms 10872 KB Output is correct
38 Correct 12 ms 10844 KB Output is correct
39 Correct 15 ms 10844 KB Output is correct
40 Correct 15 ms 10844 KB Output is correct
41 Correct 15 ms 10844 KB Output is correct
42 Correct 10 ms 10844 KB Output is correct
43 Correct 255 ms 14264 KB Output is correct
44 Correct 426 ms 17124 KB Output is correct
45 Correct 481 ms 17372 KB Output is correct
46 Correct 204 ms 16868 KB Output is correct
47 Correct 306 ms 17180 KB Output is correct
48 Correct 260 ms 21352 KB Output is correct
49 Correct 269 ms 21240 KB Output is correct
50 Correct 442 ms 17128 KB Output is correct
51 Correct 438 ms 17176 KB Output is correct
52 Correct 261 ms 21212 KB Output is correct
53 Correct 262 ms 21468 KB Output is correct
54 Correct 423 ms 19168 KB Output is correct

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 1 ms 10588 KB Output is correct
3 Correct 1 ms 10588 KB Output is correct
4 Correct 1 ms 10588 KB Output is correct
5 Correct 1 ms 10588 KB Output is correct
6 Correct 1 ms 10588 KB Output is correct
7 Correct 1 ms 10588 KB Output is correct
8 Correct 1 ms 10588 KB Output is correct
9 Correct 1 ms 10588 KB Output is correct
10 Correct 1 ms 10588 KB Output is correct
11 Correct 1 ms 10584 KB Output is correct
12 Correct 1 ms 10588 KB Output is correct
13 Correct 2 ms 10588 KB Output is correct
14 Correct 2 ms 10588 KB Output is correct
15 Correct 2 ms 10588 KB Output is correct
16 Correct 1 ms 10588 KB Output is correct
17 Correct 2 ms 10588 KB Output is correct
18 Correct 2 ms 10752 KB Output is correct
19 Correct 2 ms 10840 KB Output is correct
20 Correct 2 ms 10588 KB Output is correct
21 Correct 2 ms 10708 KB Output is correct
22 Correct 2 ms 10588 KB Output is correct
23 Correct 2 ms 10588 KB Output is correct
24 Correct 2 ms 10588 KB Output is correct
25 Correct 2 ms 10588 KB Output is correct
26 Correct 2 ms 10588 KB Output is correct
27 Correct 2 ms 10588 KB Output is correct
28 Correct 2 ms 10584 KB Output is correct
29 Correct 13 ms 11096 KB Output is correct
30 Correct 18 ms 10844 KB Output is correct
31 Correct 21 ms 11100 KB Output is correct
32 Correct 11 ms 10844 KB Output is correct
33 Correct 13 ms 10840 KB Output is correct
34 Correct 12 ms 10844 KB Output is correct
35 Correct 12 ms 10844 KB Output is correct
36 Correct 17 ms 10876 KB Output is correct
37 Correct 18 ms 10872 KB Output is correct
38 Correct 12 ms 10844 KB Output is correct
39 Correct 15 ms 10844 KB Output is correct
40 Correct 15 ms 10844 KB Output is correct
41 Correct 15 ms 10844 KB Output is correct
42 Correct 10 ms 10844 KB Output is correct
43 Correct 255 ms 14264 KB Output is correct
44 Correct 426 ms 17124 KB Output is correct
45 Correct 481 ms 17372 KB Output is correct
46 Correct 204 ms 16868 KB Output is correct
47 Correct 306 ms 17180 KB Output is correct
48 Correct 260 ms 21352 KB Output is correct
49 Correct 269 ms 21240 KB Output is correct
50 Correct 442 ms 17128 KB Output is correct
51 Correct 438 ms 17176 KB Output is correct
52 Correct 261 ms 21212 KB Output is correct
53 Correct 262 ms 21468 KB Output is correct
54 Correct 423 ms 19168 KB Output is correct
55 Correct 3392 ms 37676 KB Output is correct
56 Correct 4075 ms 46504 KB Output is correct
57 Correct 5321 ms 45880 KB Output is correct
58 Incorrect 3945 ms 46456 KB Output isn't correct
59 Halted 0 ms 0 KB -