oj.uz

Submission #1090895

# Submission time Handle Problem Language Result Execution time Memory
1090895 2024-09-19T05:40:44 Z eltu0815 Chorus (JOI23_chorus) C++14
87 / 100
 7000 ms 39692 KB 
#include <bits/stdc++.h>
#define MAX 1000005
#define MOD (ll)(1048573)
#define INF (ll)(1e12)
#define inf (int)(1e9)
#define eps (double)(1e-8)
 
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
int tt, N, K;
string str;

int cnt[MAX], pos[MAX], can[MAX], q[MAX], k[MAX];
ll dp[MAX], sum[MAX];

ll cost(int i, int j) {
    return max(sum[j] - sum[pos[i - 1] - 1] - (ll)(j - pos[i - 1] + 1) * (i - 1), 0ll);
}

ll func(int i, int j) {
    return dp[i] + cost(i + 1, j);
}

int cross(int i, int j) {
    int lo = j , hi = N + 1;
    while(lo + 1 < hi) {
        int mid = (lo + hi) >> 1;
        if(func(i, mid) <= func(j, mid)) lo = mid;
        else hi = mid;
    }
    return lo; 
}

void monotoneQueue(ll lambda) {
    int str = 0, ed = 1;
    q[0] = 0; can[0] = N;
    for(int i = 1; i <= N; ++i) {
        while(can[str] < i) ++str;
        dp[i] = func(q[str], i) + lambda; k[i] = k[q[str]] + 1;
        
        while(str + 1 < ed && can[ed - 2] >= cross(q[ed - 1], i)) --ed;
        can[ed - 1] = cross(q[ed - 1], i); q[ed] = i; can[ed] = N;
        ++ed;
    }
    
//    cout << lambda << ' ' << k[N] << endl;
//    for(int i = 1; i <= N; ++i) cout << k[i] << ' ';
//    cout << endl;
//    for(int i = 1; i <= N; ++i) cout << dp[i] - k[i] * lambda << ' ';
//    cout << endl;
//    cout << endl;

    return;
}

ll alienTrick() {
    ll lo = -1, hi = INF;
    ll ans = 0;
    while(lo + 1 < hi) {
        ll mid = (lo + hi) >> 1;
        monotoneQueue(mid);
        
        ans = max(ans, dp[N] - mid * K);
        
        if(k[N] >= K) lo = mid;
        else hi = mid;
    }
    
    return ans;
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    
    cin >> N >> K >> str;
    for(int i = 0, tmp = 0, p = 0; i < 2 * N; ++i) {
        if(str[i] == 'A') cnt[++p] = tmp;
        else ++tmp;
    }
    
    for(int i = 0, j = 1; i <= N; ++i) {
        while(j <= N && cnt[j] < i) ++j;
        pos[i] = max(i + 1, j);
    }
    
    for(int i = 1; i <= N; ++i) sum[i] = sum[i - 1] + cnt[i];
    
    cout << alienTrick();
    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 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 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 352 KB Output is correct
16 Correct 0 ms 352 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 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 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 352 KB Output is correct
16 Correct 0 ms 352 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 1 ms 352 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 3 ms 348 KB Output is correct
24 Correct 2 ms 352 KB Output is correct
25 Correct 2 ms 348 KB Output is correct
26 Correct 2 ms 352 KB Output is correct
27 Correct 2 ms 356 KB Output is correct
28 Correct 2 ms 356 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 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 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 352 KB Output is correct
16 Correct 0 ms 352 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 1 ms 352 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 3 ms 348 KB Output is correct
24 Correct 2 ms 352 KB Output is correct
25 Correct 2 ms 348 KB Output is correct
26 Correct 2 ms 352 KB Output is correct
27 Correct 2 ms 356 KB Output is correct
28 Correct 2 ms 356 KB Output is correct
29 Correct 18 ms 692 KB Output is correct
30 Correct 20 ms 604 KB Output is correct
31 Correct 21 ms 604 KB Output is correct
32 Correct 16 ms 600 KB Output is correct
33 Correct 17 ms 684 KB Output is correct
34 Correct 17 ms 680 KB Output is correct
35 Correct 17 ms 604 KB Output is correct
36 Correct 24 ms 604 KB Output is correct
37 Correct 20 ms 604 KB Output is correct
38 Correct 17 ms 724 KB Output is correct
39 Correct 19 ms 684 KB Output is correct
40 Correct 19 ms 688 KB Output is correct
41 Correct 19 ms 604 KB Output is correct
42 Correct 16 ms 600 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 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 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 352 KB Output is correct
16 Correct 0 ms 352 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 1 ms 352 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 3 ms 348 KB Output is correct
24 Correct 2 ms 352 KB Output is correct
25 Correct 2 ms 348 KB Output is correct
26 Correct 2 ms 352 KB Output is correct
27 Correct 2 ms 356 KB Output is correct
28 Correct 2 ms 356 KB Output is correct
29 Correct 18 ms 692 KB Output is correct
30 Correct 20 ms 604 KB Output is correct
31 Correct 21 ms 604 KB Output is correct
32 Correct 16 ms 600 KB Output is correct
33 Correct 17 ms 684 KB Output is correct
34 Correct 17 ms 680 KB Output is correct
35 Correct 17 ms 604 KB Output is correct
36 Correct 24 ms 604 KB Output is correct
37 Correct 20 ms 604 KB Output is correct
38 Correct 17 ms 724 KB Output is correct
39 Correct 19 ms 684 KB Output is correct
40 Correct 19 ms 688 KB Output is correct
41 Correct 19 ms 604 KB Output is correct
42 Correct 16 ms 600 KB Output is correct
43 Correct 319 ms 2648 KB Output is correct
44 Correct 565 ms 4064 KB Output is correct
45 Correct 554 ms 4064 KB Output is correct
46 Correct 423 ms 3560 KB Output is correct
47 Correct 463 ms 3808 KB Output is correct
48 Correct 456 ms 4496 KB Output is correct
49 Correct 421 ms 4320 KB Output is correct
50 Correct 608 ms 3828 KB Output is correct
51 Correct 570 ms 4008 KB Output is correct
52 Correct 460 ms 4320 KB Output is correct
53 Correct 443 ms 4524 KB Output is correct
54 Correct 539 ms 4012 KB Output is correct

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 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 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 352 KB Output is correct
16 Correct 0 ms 352 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 1 ms 352 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 3 ms 348 KB Output is correct
24 Correct 2 ms 352 KB Output is correct
25 Correct 2 ms 348 KB Output is correct
26 Correct 2 ms 352 KB Output is correct
27 Correct 2 ms 356 KB Output is correct
28 Correct 2 ms 356 KB Output is correct
29 Correct 18 ms 692 KB Output is correct
30 Correct 20 ms 604 KB Output is correct
31 Correct 21 ms 604 KB Output is correct
32 Correct 16 ms 600 KB Output is correct
33 Correct 17 ms 684 KB Output is correct
34 Correct 17 ms 680 KB Output is correct
35 Correct 17 ms 604 KB Output is correct
36 Correct 24 ms 604 KB Output is correct
37 Correct 20 ms 604 KB Output is correct
38 Correct 17 ms 724 KB Output is correct
39 Correct 19 ms 684 KB Output is correct
40 Correct 19 ms 688 KB Output is correct
41 Correct 19 ms 604 KB Output is correct
42 Correct 16 ms 600 KB Output is correct
43 Correct 319 ms 2648 KB Output is correct
44 Correct 565 ms 4064 KB Output is correct
45 Correct 554 ms 4064 KB Output is correct
46 Correct 423 ms 3560 KB Output is correct
47 Correct 463 ms 3808 KB Output is correct
48 Correct 456 ms 4496 KB Output is correct
49 Correct 421 ms 4320 KB Output is correct
50 Correct 608 ms 3828 KB Output is correct
51 Correct 570 ms 4008 KB Output is correct
52 Correct 460 ms 4320 KB Output is correct
53 Correct 443 ms 4524 KB Output is correct
54 Correct 539 ms 4012 KB Output is correct
55 Correct 4586 ms 23288 KB Output is correct
56 Correct 6228 ms 37784 KB Output is correct
57 Correct 6941 ms 35568 KB Output is correct
58 Correct 5016 ms 31676 KB Output is correct
59 Correct 4805 ms 31728 KB Output is correct
60 Correct 5315 ms 39676 KB Output is correct
61 Correct 5115 ms 39692 KB Output is correct
62 Execution timed out 7076 ms 34296 KB Time limit exceeded
63 Halted 0 ms 0 KB -