oj.uz

Submission #868514

# Submission time Handle Problem Language Result Execution time Memory
868514 2023-10-31T15:41:37 Z chonka Chorus (JOI23_chorus) C++
87 / 100
 7000 ms 34292 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 ;
}


pair < ll , int > f ( ll sr ) {
    deque < int > q ;
    q.push_front ( 0 ) ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        int sz = q.size ( ) ;
        while ( sz >= 2 && get_fst ( q[ 0 ] , q[ 1 ] ) <= i ) {
            q.pop_front ( ) ;
            -- sz ;
        }
        int x = q.front ( ) ;
        dp[ i ] = dp[ x ] + calc ( x + 1 , i ) + sr ;
        ctr[ i ] = ctr[ x ] + 1 ;


        while ( sz >= 2 && get_fst ( q[ sz - 2 ] , q[ sz - 1 ] ) >= get_fst ( q[ sz - 1 ] , i ) ) {
            q.pop_back ( ) ; 
            -- sz ;
        }
        q.push_back ( 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 << 41 ) ;
    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 ;
}

Compilation message

chorus.cpp: In function 'void solve()':
chorus.cpp:94:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   94 |         auto [ ret , cnt ] = f ( mid ) ;
      |              ^
chorus.cpp:101:10: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  101 |     auto [ ret , cnt ] = f ( r ) ;
      |          ^

Subtask #1
16.0 / 16.0

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

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 2 ms 8672 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8792 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 2 ms 8660 KB Output is correct
9 Correct 3 ms 8540 KB Output is correct
10 Correct 1 ms 8540 KB Output is correct
11 Correct 2 ms 8696 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 1 ms 8540 KB Output is correct
15 Correct 1 ms 8672 KB Output is correct
16 Correct 1 ms 8540 KB Output is correct
17 Correct 2 ms 8540 KB Output is correct
18 Correct 4 ms 8540 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 2 ms 8704 KB Output is correct
21 Correct 3 ms 8536 KB Output is correct
22 Correct 3 ms 8540 KB Output is correct
23 Correct 4 ms 8536 KB Output is correct
24 Correct 4 ms 8536 KB Output is correct
25 Correct 3 ms 8536 KB Output is correct
26 Correct 3 ms 8540 KB Output is correct
27 Correct 3 ms 8540 KB Output is correct
28 Correct 4 ms 8540 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 2 ms 8672 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8792 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 2 ms 8660 KB Output is correct
9 Correct 3 ms 8540 KB Output is correct
10 Correct 1 ms 8540 KB Output is correct
11 Correct 2 ms 8696 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 1 ms 8540 KB Output is correct
15 Correct 1 ms 8672 KB Output is correct
16 Correct 1 ms 8540 KB Output is correct
17 Correct 2 ms 8540 KB Output is correct
18 Correct 4 ms 8540 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 2 ms 8704 KB Output is correct
21 Correct 3 ms 8536 KB Output is correct
22 Correct 3 ms 8540 KB Output is correct
23 Correct 4 ms 8536 KB Output is correct
24 Correct 4 ms 8536 KB Output is correct
25 Correct 3 ms 8536 KB Output is correct
26 Correct 3 ms 8540 KB Output is correct
27 Correct 3 ms 8540 KB Output is correct
28 Correct 4 ms 8540 KB Output is correct
29 Correct 34 ms 8796 KB Output is correct
30 Correct 42 ms 8792 KB Output is correct
31 Correct 42 ms 8796 KB Output is correct
32 Correct 19 ms 8792 KB Output is correct
33 Correct 32 ms 8792 KB Output is correct
34 Correct 32 ms 8812 KB Output is correct
35 Correct 32 ms 8792 KB Output is correct
36 Correct 50 ms 8792 KB Output is correct
37 Correct 41 ms 8796 KB Output is correct
38 Correct 32 ms 8796 KB Output is correct
39 Correct 37 ms 8796 KB Output is correct
40 Correct 35 ms 8792 KB Output is correct
41 Correct 41 ms 8792 KB Output is correct
42 Correct 19 ms 8796 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 2 ms 8672 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8792 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 2 ms 8660 KB Output is correct
9 Correct 3 ms 8540 KB Output is correct
10 Correct 1 ms 8540 KB Output is correct
11 Correct 2 ms 8696 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 1 ms 8540 KB Output is correct
15 Correct 1 ms 8672 KB Output is correct
16 Correct 1 ms 8540 KB Output is correct
17 Correct 2 ms 8540 KB Output is correct
18 Correct 4 ms 8540 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 2 ms 8704 KB Output is correct
21 Correct 3 ms 8536 KB Output is correct
22 Correct 3 ms 8540 KB Output is correct
23 Correct 4 ms 8536 KB Output is correct
24 Correct 4 ms 8536 KB Output is correct
25 Correct 3 ms 8536 KB Output is correct
26 Correct 3 ms 8540 KB Output is correct
27 Correct 3 ms 8540 KB Output is correct
28 Correct 4 ms 8540 KB Output is correct
29 Correct 34 ms 8796 KB Output is correct
30 Correct 42 ms 8792 KB Output is correct
31 Correct 42 ms 8796 KB Output is correct
32 Correct 19 ms 8792 KB Output is correct
33 Correct 32 ms 8792 KB Output is correct
34 Correct 32 ms 8812 KB Output is correct
35 Correct 32 ms 8792 KB Output is correct
36 Correct 50 ms 8792 KB Output is correct
37 Correct 41 ms 8796 KB Output is correct
38 Correct 32 ms 8796 KB Output is correct
39 Correct 37 ms 8796 KB Output is correct
40 Correct 35 ms 8792 KB Output is correct
41 Correct 41 ms 8792 KB Output is correct
42 Correct 19 ms 8796 KB Output is correct
43 Correct 734 ms 14016 KB Output is correct
44 Correct 1270 ms 16412 KB Output is correct
45 Correct 1285 ms 16356 KB Output is correct
46 Correct 402 ms 16408 KB Output is correct
47 Correct 889 ms 16436 KB Output is correct
48 Correct 966 ms 16360 KB Output is correct
49 Correct 938 ms 16628 KB Output is correct
50 Correct 1324 ms 16612 KB Output is correct
51 Correct 1327 ms 16432 KB Output is correct
52 Correct 948 ms 16360 KB Output is correct
53 Correct 958 ms 16412 KB Output is correct
54 Correct 1320 ms 16440 KB Output is correct

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 2 ms 8672 KB Output is correct
5 Correct 1 ms 8540 KB Output is correct
6 Correct 1 ms 8792 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 2 ms 8660 KB Output is correct
9 Correct 3 ms 8540 KB Output is correct
10 Correct 1 ms 8540 KB Output is correct
11 Correct 2 ms 8696 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 1 ms 8540 KB Output is correct
15 Correct 1 ms 8672 KB Output is correct
16 Correct 1 ms 8540 KB Output is correct
17 Correct 2 ms 8540 KB Output is correct
18 Correct 4 ms 8540 KB Output is correct
19 Correct 4 ms 8540 KB Output is correct
20 Correct 2 ms 8704 KB Output is correct
21 Correct 3 ms 8536 KB Output is correct
22 Correct 3 ms 8540 KB Output is correct
23 Correct 4 ms 8536 KB Output is correct
24 Correct 4 ms 8536 KB Output is correct
25 Correct 3 ms 8536 KB Output is correct
26 Correct 3 ms 8540 KB Output is correct
27 Correct 3 ms 8540 KB Output is correct
28 Correct 4 ms 8540 KB Output is correct
29 Correct 34 ms 8796 KB Output is correct
30 Correct 42 ms 8792 KB Output is correct
31 Correct 42 ms 8796 KB Output is correct
32 Correct 19 ms 8792 KB Output is correct
33 Correct 32 ms 8792 KB Output is correct
34 Correct 32 ms 8812 KB Output is correct
35 Correct 32 ms 8792 KB Output is correct
36 Correct 50 ms 8792 KB Output is correct
37 Correct 41 ms 8796 KB Output is correct
38 Correct 32 ms 8796 KB Output is correct
39 Correct 37 ms 8796 KB Output is correct
40 Correct 35 ms 8792 KB Output is correct
41 Correct 41 ms 8792 KB Output is correct
42 Correct 19 ms 8796 KB Output is correct
43 Correct 734 ms 14016 KB Output is correct
44 Correct 1270 ms 16412 KB Output is correct
45 Correct 1285 ms 16356 KB Output is correct
46 Correct 402 ms 16408 KB Output is correct
47 Correct 889 ms 16436 KB Output is correct
48 Correct 966 ms 16360 KB Output is correct
49 Correct 938 ms 16628 KB Output is correct
50 Correct 1324 ms 16612 KB Output is correct
51 Correct 1327 ms 16432 KB Output is correct
52 Correct 948 ms 16360 KB Output is correct
53 Correct 958 ms 16412 KB Output is correct
54 Correct 1320 ms 16440 KB Output is correct
55 Execution timed out 7096 ms 34292 KB Time limit exceeded
56 Halted 0 ms 0 KB -