답안 #855331

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
855331	2023-10-01T05:44:35 Z	willychan	Chorus (JOI23_chorus)	C++14	61 / 100	7000 ms	4180 KB

chorus

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include<bits/extc++.h>
//__gnu_pbds
#define int ll
const int N = 1e5+5;
pair<ll,int> dp[N];
int Bpa[N];
ll Bpasum[N];
int n,K;

ll cost(int i,int j){
	int l = i;
	int r = j+1;
	while(r-l>1){
		int mid = (l+r)/2;
		if(Bpa[mid]<j) l = mid;
		else r = mid;
	}
	ll cnt = l-i;
	ll ans = Bpasum[l]-Bpasum[i];
	return cnt*j-ans;	
}

struct seg{
	int pos;int l;int r;
	seg(int _pos,int _l,int _r):pos(_pos),l(_l),r(_r){}
};

bool ok(int v){
	for(int i=0;i<=n;i++) dp[i] = {1e18,0};
	dp[0]={0,0};
	dp[n+1] = {1e15,0};
	deque<seg> dq;
	dq.push_back(seg(0,1,n));
	for(int i=1;i<=n;i++){
		while(dq.size()){
			if(dq[0].r<i) dq.pop_front();
			else break;
		}
		dp[i] = {dp[dq[0].pos].first+cost(dq[0].pos,i)+v,dp[dq[0].pos].second+1};
		while(dq.size()){
			if(dp[dq.back().pos].first+cost(dq.back().pos,dq.back().l)>dp[i].first+cost(i,dq.back().l)) dq.pop_back();
			else break;
		}
		if(dq.empty()) dq.push_back(seg(i,i+1,n));
		else{
			seg pseg = dq.back();
			dq.pop_back();
			int l = pseg.l;int r = pseg.r+1;
			while(r-l>1){
				int mid = (l+r)/2;
				if(dp[pseg.pos].first+cost(pseg.pos,mid)>dp[i].first+cost(i,mid)) r=mid;
				else l = mid;
			}
			dq.push_back(seg(pseg.pos,pseg.l,l));
			if(l!=n) dq.push_back(seg(i,l+1,n));
		}
	}
	//cout<<(dp[n].second<=K)<<" "<<dp[n].first<<" "<<v<<"\n";
	return (dp[n].second<=K);
}
 
signed main(){
	ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>n>>K;			
	string s;cin>>s;
	int pa = 0;
	int pb = 0;
	for(int i=1;i<=2*n;i++){
		if(s[i-1]=='A') pa++;
		if(s[i-1]=='B') Bpa[++pb]=pa;
	}
	for(int i=1;i<=n;i++){
		Bpasum[i] = Bpasum[i-1]+Bpa[i];
	}
	ll l = -1;ll r = 1e12;
	while(r-l>1){
		ll mid = l+((r-l)/2);
		if(ok(mid)) r = mid;
		else l = mid;
	}
	ok(r);
	//cout<<r<<"\n";
	cout<<dp[n].first-r*K<<"\n";
 
	return 0;
}

Subtask #1
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2552 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	0 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	0 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	0 ms	2396 KB	Output is correct
12	Correct	1 ms	2392 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	0 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	0 ms	2396 KB	Output is correct

Subtask #2
24.0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2552 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	0 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	0 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	0 ms	2396 KB	Output is correct
12	Correct	1 ms	2392 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	0 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	0 ms	2396 KB	Output is correct
17	Correct	3 ms	2396 KB	Output is correct
18	Correct	9 ms	2516 KB	Output is correct
19	Correct	10 ms	2392 KB	Output is correct
20	Correct	11 ms	2524 KB	Output is correct
21	Correct	10 ms	2516 KB	Output is correct
22	Correct	10 ms	2524 KB	Output is correct
23	Correct	10 ms	2524 KB	Output is correct
24	Correct	10 ms	2516 KB	Output is correct
25	Correct	9 ms	2520 KB	Output is correct
26	Correct	10 ms	2396 KB	Output is correct
27	Correct	9 ms	2520 KB	Output is correct
28	Correct	9 ms	2396 KB	Output is correct

Subtask #3
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2552 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	0 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	0 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	0 ms	2396 KB	Output is correct
12	Correct	1 ms	2392 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	0 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	0 ms	2396 KB	Output is correct
17	Correct	3 ms	2396 KB	Output is correct
18	Correct	9 ms	2516 KB	Output is correct
19	Correct	10 ms	2392 KB	Output is correct
20	Correct	11 ms	2524 KB	Output is correct
21	Correct	10 ms	2516 KB	Output is correct
22	Correct	10 ms	2524 KB	Output is correct
23	Correct	10 ms	2524 KB	Output is correct
24	Correct	10 ms	2516 KB	Output is correct
25	Correct	9 ms	2520 KB	Output is correct
26	Correct	10 ms	2396 KB	Output is correct
27	Correct	9 ms	2520 KB	Output is correct
28	Correct	9 ms	2396 KB	Output is correct
29	Correct	166 ms	2804 KB	Output is correct
30	Correct	158 ms	2572 KB	Output is correct
31	Correct	156 ms	2552 KB	Output is correct
32	Correct	211 ms	2556 KB	Output is correct
33	Correct	175 ms	2900 KB	Output is correct
34	Correct	171 ms	2592 KB	Output is correct
35	Correct	167 ms	2396 KB	Output is correct
36	Correct	170 ms	2392 KB	Output is correct
37	Correct	154 ms	2396 KB	Output is correct
38	Correct	169 ms	2568 KB	Output is correct
39	Correct	162 ms	2392 KB	Output is correct
40	Correct	147 ms	2396 KB	Output is correct
41	Correct	140 ms	2392 KB	Output is correct
42	Correct	202 ms	2396 KB	Output is correct

Subtask #4
0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2552 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	0 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	0 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	0 ms	2396 KB	Output is correct
12	Correct	1 ms	2392 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	0 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	0 ms	2396 KB	Output is correct
17	Correct	3 ms	2396 KB	Output is correct
18	Correct	9 ms	2516 KB	Output is correct
19	Correct	10 ms	2392 KB	Output is correct
20	Correct	11 ms	2524 KB	Output is correct
21	Correct	10 ms	2516 KB	Output is correct
22	Correct	10 ms	2524 KB	Output is correct
23	Correct	10 ms	2524 KB	Output is correct
24	Correct	10 ms	2516 KB	Output is correct
25	Correct	9 ms	2520 KB	Output is correct
26	Correct	10 ms	2396 KB	Output is correct
27	Correct	9 ms	2520 KB	Output is correct
28	Correct	9 ms	2396 KB	Output is correct
29	Correct	166 ms	2804 KB	Output is correct
30	Correct	158 ms	2572 KB	Output is correct
31	Correct	156 ms	2552 KB	Output is correct
32	Correct	211 ms	2556 KB	Output is correct
33	Correct	175 ms	2900 KB	Output is correct
34	Correct	171 ms	2592 KB	Output is correct
35	Correct	167 ms	2396 KB	Output is correct
36	Correct	170 ms	2392 KB	Output is correct
37	Correct	154 ms	2396 KB	Output is correct
38	Correct	169 ms	2568 KB	Output is correct
39	Correct	162 ms	2392 KB	Output is correct
40	Correct	147 ms	2396 KB	Output is correct
41	Correct	140 ms	2392 KB	Output is correct
42	Correct	202 ms	2396 KB	Output is correct
43	Correct	2582 ms	3316 KB	Output is correct
44	Correct	4641 ms	4180 KB	Output is correct
45	Correct	4573 ms	4068 KB	Output is correct
46	Execution timed out	7059 ms	4064 KB	Time limit exceeded
47	Halted	0 ms	0 KB	-

Subtask #5
0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2552 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	0 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	0 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	0 ms	2396 KB	Output is correct
12	Correct	1 ms	2392 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	0 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	0 ms	2396 KB	Output is correct
17	Correct	3 ms	2396 KB	Output is correct
18	Correct	9 ms	2516 KB	Output is correct
19	Correct	10 ms	2392 KB	Output is correct
20	Correct	11 ms	2524 KB	Output is correct
21	Correct	10 ms	2516 KB	Output is correct
22	Correct	10 ms	2524 KB	Output is correct
23	Correct	10 ms	2524 KB	Output is correct
24	Correct	10 ms	2516 KB	Output is correct
25	Correct	9 ms	2520 KB	Output is correct
26	Correct	10 ms	2396 KB	Output is correct
27	Correct	9 ms	2520 KB	Output is correct
28	Correct	9 ms	2396 KB	Output is correct
29	Correct	166 ms	2804 KB	Output is correct
30	Correct	158 ms	2572 KB	Output is correct
31	Correct	156 ms	2552 KB	Output is correct
32	Correct	211 ms	2556 KB	Output is correct
33	Correct	175 ms	2900 KB	Output is correct
34	Correct	171 ms	2592 KB	Output is correct
35	Correct	167 ms	2396 KB	Output is correct
36	Correct	170 ms	2392 KB	Output is correct
37	Correct	154 ms	2396 KB	Output is correct
38	Correct	169 ms	2568 KB	Output is correct
39	Correct	162 ms	2392 KB	Output is correct
40	Correct	147 ms	2396 KB	Output is correct
41	Correct	140 ms	2392 KB	Output is correct
42	Correct	202 ms	2396 KB	Output is correct
43	Correct	2582 ms	3316 KB	Output is correct
44	Correct	4641 ms	4180 KB	Output is correct
45	Correct	4573 ms	4068 KB	Output is correct
46	Execution timed out	7059 ms	4064 KB	Time limit exceeded
47	Halted	0 ms	0 KB	-

답안 #855331

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