Submission #1032798

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1032798	2024-07-24T08:54:29 Z	Unforgettablepl	Chorus (JOI23_chorus)	C++17	40 / 100	7000 ms	732 KB

chorus

#include <bits/stdc++.h>
using namespace std;
 
#define int long long
 
const int INF = 1e13;
 
struct fenwick{
	vector<int> tree;
	int n;
	fenwick(int n):n(n),tree(n+1){}
	void add(int k,int x){
		while(k<=n){
			tree[k]+=x;
			k+=k&-k;
		}
	}
	int get(int k){
		int ans = 0;
		while(k){
			ans+=tree[k];
			k-=k&-k;
		}
		return ans;
	}
};
 
int32_t main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	int n,k;
	cin >> n >> k;
	string s;
	cin >> s;
	s.insert(s.begin(),'$');
	vector<int> posA(n+1);
	vector<int> posB(n+1);
	int cntA = 0,cntB = 0;
	for(int i=1;i<=2*n;i++){
		if(s[i]=='A'){
			posA[++cntA]=i;
		} else {
			posB[++cntB]=i;
		}
	}
	vector<int> costA(n+1);
	{
		fenwick temp(2*n);
		for(int i=n;i;i--){
			temp.add(posB[i],1);
			costA[i] = temp.get(posA[i]);
		}
		for(int i=1;i<=n;i++)costA[i]+=costA[i-1];
	}
	auto cost = [&](int a,int b){
		int Ac = costA[b]-costA[a-1];

		return Ac;
	};
	auto solve = [&](int penalty){
		vector<pair<int,int>> DP(n+1,{INF,INF});
		DP[0]={0,0};
		for(int i=1;i<=n;i++){
			fenwick addedA(2*n);
			int ans = penalty;
			for(int j=i;j;j--){
				ans+=addedA.get(2*n)-addedA.get(posB[j]);
				addedA.add(posA[j],1);
				DP[i]=min(DP[i],{DP[j-1].first+ans+cost(j,i),DP[j-1].second+1});
			}
		}
		return DP[n];
	};
	int best_penalty = -1;
	for(int jump=(1ll<<40);jump;jump/=2ll){
		if(solve(best_penalty+jump).second>k)best_penalty+=jump;
	}
	best_penalty++;
	cout << solve(best_penalty).first-k*best_penalty << '\n';
}

Compilation message

chorus.cpp: In constructor 'fenwick::fenwick(long long int)':
chorus.cpp:10:6: warning: 'fenwick::n' will be initialized after [-Wreorder]
   10 |  int n;
      |      ^
chorus.cpp:9:14: warning:   'std::vector<long long int> fenwick::tree' [-Wreorder]
    9 |  vector<int> tree;
      |              ^~~~
chorus.cpp:11:2: warning:   when initialized here [-Wreorder]
   11 |  fenwick(int n):n(n),tree(n+1){}
      |  ^~~~~~~

Subtask #1

16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	344 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	1 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	344 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

Subtask #2

24.0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	344 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	1 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	344 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	7 ms	348 KB	Output is correct
18	Correct	59 ms	348 KB	Output is correct
19	Correct	54 ms	348 KB	Output is correct
20	Correct	47 ms	344 KB	Output is correct
21	Correct	51 ms	348 KB	Output is correct
22	Correct	57 ms	348 KB	Output is correct
23	Correct	67 ms	604 KB	Output is correct
24	Correct	63 ms	344 KB	Output is correct
25	Correct	63 ms	348 KB	Output is correct
26	Correct	60 ms	348 KB	Output is correct
27	Correct	64 ms	344 KB	Output is correct
28	Correct	63 ms	348 KB	Output is correct

Subtask #3

0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	344 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	1 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	344 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	7 ms	348 KB	Output is correct
18	Correct	59 ms	348 KB	Output is correct
19	Correct	54 ms	348 KB	Output is correct
20	Correct	47 ms	344 KB	Output is correct
21	Correct	51 ms	348 KB	Output is correct
22	Correct	57 ms	348 KB	Output is correct
23	Correct	67 ms	604 KB	Output is correct
24	Correct	63 ms	344 KB	Output is correct
25	Correct	63 ms	348 KB	Output is correct
26	Correct	60 ms	348 KB	Output is correct
27	Correct	64 ms	344 KB	Output is correct
28	Correct	63 ms	348 KB	Output is correct
29	Execution timed out	7007 ms	732 KB	Time limit exceeded
30	Halted	0 ms	0 KB	-

Subtask #4

0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	344 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	1 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	344 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	7 ms	348 KB	Output is correct
18	Correct	59 ms	348 KB	Output is correct
19	Correct	54 ms	348 KB	Output is correct
20	Correct	47 ms	344 KB	Output is correct
21	Correct	51 ms	348 KB	Output is correct
22	Correct	57 ms	348 KB	Output is correct
23	Correct	67 ms	604 KB	Output is correct
24	Correct	63 ms	344 KB	Output is correct
25	Correct	63 ms	348 KB	Output is correct
26	Correct	60 ms	348 KB	Output is correct
27	Correct	64 ms	344 KB	Output is correct
28	Correct	63 ms	348 KB	Output is correct
29	Execution timed out	7007 ms	732 KB	Time limit exceeded
30	Halted	0 ms	0 KB	-

Subtask #5

0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	344 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	1 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	344 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	7 ms	348 KB	Output is correct
18	Correct	59 ms	348 KB	Output is correct
19	Correct	54 ms	348 KB	Output is correct
20	Correct	47 ms	344 KB	Output is correct
21	Correct	51 ms	348 KB	Output is correct
22	Correct	57 ms	348 KB	Output is correct
23	Correct	67 ms	604 KB	Output is correct
24	Correct	63 ms	344 KB	Output is correct
25	Correct	63 ms	348 KB	Output is correct
26	Correct	60 ms	348 KB	Output is correct
27	Correct	64 ms	344 KB	Output is correct
28	Correct	63 ms	348 KB	Output is correct
29	Execution timed out	7007 ms	732 KB	Time limit exceeded
30	Halted	0 ms	0 KB	-