oj.uz

Submission #1090902

# Submission time Handle Problem Language Result Execution time Memory
1090902 2024-09-19T06:08:48 Z eltu0815 Chorus (JOI23_chorus) C++14
100 / 100
 864 ms 39668 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), -INF);
}

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;
//    }
    
    //sum[j] - j * (i - 1) - sum[pos[i - 1] - 1] + (ll)(pos[i - 1] - 1) * (i - 1)
    //x * (j - i) + C1 <= C2
    ll C1 = dp[i] - sum[pos[i] - 1] + (ll)(pos[i] - 1) * (i), C2 = dp[j] - sum[pos[j] - 1] + (ll)(pos[j] - 1) * (j);
    ll x1 = min((C2 - C1) / (j - i), (ll)N);
    
    //cout << i << ' ' << j << ' ' << x1 <<  ' ' << lo << endl;

    return x1; 
}

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;
    }

    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];
    
//    for(int i = 0; i <= N; ++i) {
//        cout << - sum[pos[i - 1] - 1] + (ll)(pos[i - 1] - 1) * (i - 1) << endl;
//    }

//    for(int i = 1; i <= N; ++i) for(int j = i; j <= N; ++j) {
//        cout << i << ' ' << j << ' ' << cost(i, j) << endl;
//    }
    
    cout << alienTrick();
    return 0;
}

Subtask #1
16.0 / 16.0

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

Subtask #2
24.0 / 24.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 352 KB Output is correct
4 Correct 0 ms 352 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 1 ms 464 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 464 KB Output is correct
16 Correct 1 ms 352 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 352 KB Output is correct
21 Correct 0 ms 464 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 352 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 352 KB Output is correct
27 Correct 1 ms 356 KB Output is correct
28 Correct 1 ms 356 KB Output is correct
29 Correct 3 ms 844 KB Output is correct
30 Correct 3 ms 604 KB Output is correct
31 Correct 4 ms 604 KB Output is correct
32 Correct 3 ms 680 KB Output is correct
33 Correct 2 ms 604 KB Output is correct
34 Correct 2 ms 680 KB Output is correct
35 Correct 2 ms 492 KB Output is correct
36 Correct 3 ms 604 KB Output is correct
37 Correct 4 ms 600 KB Output is correct
38 Correct 3 ms 604 KB Output is correct
39 Correct 4 ms 684 KB Output is correct
40 Correct 3 ms 676 KB Output is correct
41 Correct 3 ms 604 KB Output is correct
42 Correct 2 ms 472 KB Output is correct
43 Correct 43 ms 2656 KB Output is correct
44 Correct 73 ms 4060 KB Output is correct
45 Correct 72 ms 4060 KB Output is correct
46 Correct 47 ms 3560 KB Output is correct
47 Correct 45 ms 3812 KB Output is correct
48 Correct 39 ms 4328 KB Output is correct
49 Correct 40 ms 4328 KB Output is correct
50 Correct 71 ms 3812 KB Output is correct
51 Correct 72 ms 4068 KB Output is correct
52 Correct 37 ms 4316 KB Output is correct
53 Correct 37 ms 4440 KB Output is correct
54 Correct 70 ms 4072 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 352 KB Output is correct
4 Correct 0 ms 352 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 1 ms 464 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 464 KB Output is correct
16 Correct 1 ms 352 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 352 KB Output is correct
21 Correct 0 ms 464 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 352 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 352 KB Output is correct
27 Correct 1 ms 356 KB Output is correct
28 Correct 1 ms 356 KB Output is correct
29 Correct 3 ms 844 KB Output is correct
30 Correct 3 ms 604 KB Output is correct
31 Correct 4 ms 604 KB Output is correct
32 Correct 3 ms 680 KB Output is correct
33 Correct 2 ms 604 KB Output is correct
34 Correct 2 ms 680 KB Output is correct
35 Correct 2 ms 492 KB Output is correct
36 Correct 3 ms 604 KB Output is correct
37 Correct 4 ms 600 KB Output is correct
38 Correct 3 ms 604 KB Output is correct
39 Correct 4 ms 684 KB Output is correct
40 Correct 3 ms 676 KB Output is correct
41 Correct 3 ms 604 KB Output is correct
42 Correct 2 ms 472 KB Output is correct
43 Correct 43 ms 2656 KB Output is correct
44 Correct 73 ms 4060 KB Output is correct
45 Correct 72 ms 4060 KB Output is correct
46 Correct 47 ms 3560 KB Output is correct
47 Correct 45 ms 3812 KB Output is correct
48 Correct 39 ms 4328 KB Output is correct
49 Correct 40 ms 4328 KB Output is correct
50 Correct 71 ms 3812 KB Output is correct
51 Correct 72 ms 4068 KB Output is correct
52 Correct 37 ms 4316 KB Output is correct
53 Correct 37 ms 4440 KB Output is correct
54 Correct 70 ms 4072 KB Output is correct
55 Correct 492 ms 23136 KB Output is correct
56 Correct 565 ms 37928 KB Output is correct
57 Correct 815 ms 35568 KB Output is correct
58 Correct 483 ms 31848 KB Output is correct
59 Correct 471 ms 31736 KB Output is correct
60 Correct 391 ms 39536 KB Output is correct
61 Correct 395 ms 39668 KB Output is correct
62 Correct 811 ms 34544 KB Output is correct
63 Correct 847 ms 34936 KB Output is correct
64 Correct 397 ms 39668 KB Output is correct
65 Correct 397 ms 39668 KB Output is correct
66 Correct 864 ms 35372 KB Output is correct
67 Correct 395 ms 39580 KB Output is correct