Submission #1029817

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1029817	2024-07-21T11:17:35 Z	Unforgettablepl	Chorus (JOI23_chorus)	C++17	40 / 100	7000 ms	80212 KB

chorus

#include <bits/stdc++.h>
using namespace std;

#define int long long

const int INF = 1e12;

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<vector<int>> DP(n+1,vector<int>(k+1,INF));
	DP[0][0]=0;
	for(int i=1;i<=n;i++){
		fenwick addedA(2*n);
		fenwick addedB(2*n);
		int ans = 0;
		for(int j=i+1;j<=n;j++)addedB.add(posB[j],1);
		for(int j=i;j;j--){
			ans+=addedA.get(2*n)-addedA.get(posB[j]);
			addedB.add(posB[j],1);
			ans+=addedB.get(posA[j]);
			addedA.add(posA[j],1);
			for(int l=1;l<=k;l++){
				DP[i][l]=min(DP[i][l],DP[j-1][l-1]+ans);
			}
		}
	}
	cout << DP[n][k] << '\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	412 KB	Output is correct
4	Correct	1 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	1 ms	344 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	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 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	412 KB	Output is correct
4	Correct	1 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	1 ms	344 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	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 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	2 ms	348 KB	Output is correct
18	Correct	11 ms	876 KB	Output is correct
19	Correct	27 ms	1476 KB	Output is correct
20	Correct	3 ms	348 KB	Output is correct
21	Correct	4 ms	348 KB	Output is correct
22	Correct	44 ms	2396 KB	Output is correct
23	Correct	55 ms	2396 KB	Output is correct
24	Correct	4 ms	344 KB	Output is correct
25	Correct	42 ms	2392 KB	Output is correct
26	Correct	38 ms	1880 KB	Output is correct
27	Correct	20 ms	1112 KB	Output is correct
28	Correct	19 ms	1164 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	412 KB	Output is correct
4	Correct	1 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	1 ms	344 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	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 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	2 ms	348 KB	Output is correct
18	Correct	11 ms	876 KB	Output is correct
19	Correct	27 ms	1476 KB	Output is correct
20	Correct	3 ms	348 KB	Output is correct
21	Correct	4 ms	348 KB	Output is correct
22	Correct	44 ms	2396 KB	Output is correct
23	Correct	55 ms	2396 KB	Output is correct
24	Correct	4 ms	344 KB	Output is correct
25	Correct	42 ms	2392 KB	Output is correct
26	Correct	38 ms	1880 KB	Output is correct
27	Correct	20 ms	1112 KB	Output is correct
28	Correct	19 ms	1164 KB	Output is correct
29	Execution timed out	7034 ms	80212 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	412 KB	Output is correct
4	Correct	1 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	1 ms	344 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	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 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	2 ms	348 KB	Output is correct
18	Correct	11 ms	876 KB	Output is correct
19	Correct	27 ms	1476 KB	Output is correct
20	Correct	3 ms	348 KB	Output is correct
21	Correct	4 ms	348 KB	Output is correct
22	Correct	44 ms	2396 KB	Output is correct
23	Correct	55 ms	2396 KB	Output is correct
24	Correct	4 ms	344 KB	Output is correct
25	Correct	42 ms	2392 KB	Output is correct
26	Correct	38 ms	1880 KB	Output is correct
27	Correct	20 ms	1112 KB	Output is correct
28	Correct	19 ms	1164 KB	Output is correct
29	Execution timed out	7034 ms	80212 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	412 KB	Output is correct
4	Correct	1 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	1 ms	344 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	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 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	2 ms	348 KB	Output is correct
18	Correct	11 ms	876 KB	Output is correct
19	Correct	27 ms	1476 KB	Output is correct
20	Correct	3 ms	348 KB	Output is correct
21	Correct	4 ms	348 KB	Output is correct
22	Correct	44 ms	2396 KB	Output is correct
23	Correct	55 ms	2396 KB	Output is correct
24	Correct	4 ms	344 KB	Output is correct
25	Correct	42 ms	2392 KB	Output is correct
26	Correct	38 ms	1880 KB	Output is correct
27	Correct	20 ms	1112 KB	Output is correct
28	Correct	19 ms	1164 KB	Output is correct
29	Execution timed out	7034 ms	80212 KB	Time limit exceeded
30	Halted	0 ms	0 KB	-

Submission #1029817

Compilation message

Subtask #1 16.0 / 16.0

Subtask #2 24.0 / 24.0

Subtask #3 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
0 / 21.0

Subtask #4
0 / 26.0

Subtask #5
0 / 13.0