답안 #1090896

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1090896	2024-09-19T05:42:41 Z	eltu0815	Chorus (JOI23_chorus)	C++14	61 / 100	459 ms	4064 KB

chorus

#include <bits/stdc++.h>
#define MAX 1000005
#define MOD (ll)(1048573)
#define INF (ll)(1e9)
#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;
    }

    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

#	결과	메모리	Grader output
1	Correct	344 KB	Output is correct
2	Correct	600 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	344 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	348 KB	Output is correct
11	Correct	348 KB	Output is correct
12	Correct	348 KB	Output is correct
13	Correct	348 KB	Output is correct
14	Correct	348 KB	Output is correct
15	Correct	348 KB	Output is correct
16	Correct	348 KB	Output is correct

Subtask #2
24.0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	600 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	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	2 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	2 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct

Subtask #3
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	600 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	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	2 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	2 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	14 ms	600 KB	Output is correct
30	Correct	17 ms	600 KB	Output is correct
31	Correct	17 ms	600 KB	Output is correct
32	Correct	12 ms	668 KB	Output is correct
33	Correct	13 ms	632 KB	Output is correct
34	Correct	13 ms	600 KB	Output is correct
35	Correct	13 ms	704 KB	Output is correct
36	Correct	20 ms	624 KB	Output is correct
37	Correct	19 ms	676 KB	Output is correct
38	Correct	13 ms	600 KB	Output is correct
39	Correct	15 ms	604 KB	Output is correct
40	Correct	15 ms	688 KB	Output is correct
41	Correct	15 ms	688 KB	Output is correct
42	Correct	12 ms	604 KB	Output is correct

Subtask #4
0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	600 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	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	2 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	2 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	14 ms	600 KB	Output is correct
30	Correct	17 ms	600 KB	Output is correct
31	Correct	17 ms	600 KB	Output is correct
32	Correct	12 ms	668 KB	Output is correct
33	Correct	13 ms	632 KB	Output is correct
34	Correct	13 ms	600 KB	Output is correct
35	Correct	13 ms	704 KB	Output is correct
36	Correct	20 ms	624 KB	Output is correct
37	Correct	19 ms	676 KB	Output is correct
38	Correct	13 ms	600 KB	Output is correct
39	Correct	15 ms	604 KB	Output is correct
40	Correct	15 ms	688 KB	Output is correct
41	Correct	15 ms	688 KB	Output is correct
42	Correct	12 ms	604 KB	Output is correct
43	Correct	253 ms	2484 KB	Output is correct
44	Correct	459 ms	4064 KB	Output is correct
45	Correct	440 ms	3800 KB	Output is correct
46	Incorrect	427 ms	3700 KB	Output isn't correct
47	Halted	0 ms	0 KB	-

Subtask #5
0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	600 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	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	2 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	2 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	14 ms	600 KB	Output is correct
30	Correct	17 ms	600 KB	Output is correct
31	Correct	17 ms	600 KB	Output is correct
32	Correct	12 ms	668 KB	Output is correct
33	Correct	13 ms	632 KB	Output is correct
34	Correct	13 ms	600 KB	Output is correct
35	Correct	13 ms	704 KB	Output is correct
36	Correct	20 ms	624 KB	Output is correct
37	Correct	19 ms	676 KB	Output is correct
38	Correct	13 ms	600 KB	Output is correct
39	Correct	15 ms	604 KB	Output is correct
40	Correct	15 ms	688 KB	Output is correct
41	Correct	15 ms	688 KB	Output is correct
42	Correct	12 ms	604 KB	Output is correct
43	Correct	253 ms	2484 KB	Output is correct
44	Correct	459 ms	4064 KB	Output is correct
45	Correct	440 ms	3800 KB	Output is correct
46	Incorrect	427 ms	3700 KB	Output isn't correct
47	Halted	0 ms	0 KB	-

답안 #1090896

Compilation message

Subtask #1 16.0 / 16.0

Subtask #2 24.0 / 24.0

Subtask #3 21.0 / 21.0

Subtask #4 0 / 26.0

Subtask #5 0 / 13.0

Subtask #1
16.0 / 16.0

Subtask #2
24.0 / 24.0

Subtask #3
21.0 / 21.0

Subtask #4
0 / 26.0

Subtask #5
0 / 13.0