답안 #789144

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
789144	2023-07-21T06:29:48 Z	박상훈(#10042)	Chorus (JOI23_chorus)	C++17	40 / 100	111 ms	4316 KB

chorus

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
constexpr ll INF = 4e18;
char s[2002000];
int a[1001000], b[1001000], nxt[2002000], prv[2002000];
ll cst[505][505], dp[505][505], sum[1001000];

inline ll cost(int l, int r){
	int r2 = min(r, prv[a[r]]);
	if (r2 < l) return 0;

	return (ll)(r+1) * (r2-l+1) - (sum[r2] - sum[l-1]);
}

int main(){
	int n, k;
	scanf("%d %d", &n, &k);

	scanf("%s", s+1);
	int ptA = 1, ptB = 1;
	for (int i=1;i<=n*2;i++){
		if (s[i]=='A'){
			// mp[i] = ptA;
			prv[i] = ptB-1;
			a[ptA++] = i;
		} 
		else{
			// mp[i] = ptB;
			prv[i] = ptB;
			b[ptB++] = i;
		}
	}

	for (int i=n*2;i;i--){
		if (s[i]=='A') nxt[i] = --ptA;
		else nxt[i] = ptA;
	}

	for (int i=1;i<=n;i++) sum[i] = sum[i-1] + nxt[b[i]];

	for (int i=1;i<=n;i++){
		for (int j=i;j<=n;j++){
			for (int k=i;k<=j;k++){
				cst[i][j] += max(j-nxt[b[k]]+1, 0);
			}

			if (cst[i][j]!=cost(i, j)){
				printf("%d %d -> %lld %lld\n", i, j, cst[i][j], cost(i, j));
			}
			assert(cst[i][j] == cost(i, j));
		}
	}

	// is cost monge?
	for (int i=1;i<=n-1;i++){
		for (int j=i+1;j<=n-1;j++){
			assert(cst[i][j] + cst[i+1][j+1] <= cst[i][j+1] + cst[i+1][j]);
		}
	}

	for (int i=0;i<=n;i++){
		fill(dp[i], dp[i]+k+1, INF);
	}
	dp[0][0] = 0;

	for (int i=1;i<=n;i++){
		for (int j=1;j<=k;j++){
			for (int p=0;p<i;p++) dp[i][j] = min(dp[i][j], dp[p][j-1] + cst[p+1][i]);
		}
	}

	printf("%lld\n", dp[n][k]);
}

Compilation message

chorus.cpp: In function 'int main()':
chorus.cpp:19:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |  scanf("%d %d", &n, &k);
      |  ~~~~~^~~~~~~~~~~~~~~~~
chorus.cpp:21:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |  scanf("%s", s+1);
      |  ~~~~~^~~~~~~~~~~

Subtask #1
16.0 / 16.0

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

Subtask #2
24.0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	2 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	3 ms	1748 KB	Output is correct
18	Correct	35 ms	4316 KB	Output is correct
19	Correct	64 ms	4312 KB	Output is correct
20	Correct	26 ms	4288 KB	Output is correct
21	Correct	21 ms	4232 KB	Output is correct
22	Correct	98 ms	4268 KB	Output is correct
23	Correct	98 ms	4308 KB	Output is correct
24	Correct	24 ms	4308 KB	Output is correct
25	Correct	111 ms	4312 KB	Output is correct
26	Correct	87 ms	4308 KB	Output is correct
27	Correct	46 ms	4228 KB	Output is correct
28	Correct	46 ms	4308 KB	Output is correct

Subtask #3
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	2 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	3 ms	1748 KB	Output is correct
18	Correct	35 ms	4316 KB	Output is correct
19	Correct	64 ms	4312 KB	Output is correct
20	Correct	26 ms	4288 KB	Output is correct
21	Correct	21 ms	4232 KB	Output is correct
22	Correct	98 ms	4268 KB	Output is correct
23	Correct	98 ms	4308 KB	Output is correct
24	Correct	24 ms	4308 KB	Output is correct
25	Correct	111 ms	4312 KB	Output is correct
26	Correct	87 ms	4308 KB	Output is correct
27	Correct	46 ms	4228 KB	Output is correct
28	Correct	46 ms	4308 KB	Output is correct
29	Runtime error	12 ms	932 KB	Execution killed with signal 6
30	Halted	0 ms	0 KB	-

Subtask #4
0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	2 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	3 ms	1748 KB	Output is correct
18	Correct	35 ms	4316 KB	Output is correct
19	Correct	64 ms	4312 KB	Output is correct
20	Correct	26 ms	4288 KB	Output is correct
21	Correct	21 ms	4232 KB	Output is correct
22	Correct	98 ms	4268 KB	Output is correct
23	Correct	98 ms	4308 KB	Output is correct
24	Correct	24 ms	4308 KB	Output is correct
25	Correct	111 ms	4312 KB	Output is correct
26	Correct	87 ms	4308 KB	Output is correct
27	Correct	46 ms	4228 KB	Output is correct
28	Correct	46 ms	4308 KB	Output is correct
29	Runtime error	12 ms	932 KB	Execution killed with signal 6
30	Halted	0 ms	0 KB	-

Subtask #5
0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	2 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	3 ms	1748 KB	Output is correct
18	Correct	35 ms	4316 KB	Output is correct
19	Correct	64 ms	4312 KB	Output is correct
20	Correct	26 ms	4288 KB	Output is correct
21	Correct	21 ms	4232 KB	Output is correct
22	Correct	98 ms	4268 KB	Output is correct
23	Correct	98 ms	4308 KB	Output is correct
24	Correct	24 ms	4308 KB	Output is correct
25	Correct	111 ms	4312 KB	Output is correct
26	Correct	87 ms	4308 KB	Output is correct
27	Correct	46 ms	4228 KB	Output is correct
28	Correct	46 ms	4308 KB	Output is correct
29	Runtime error	12 ms	932 KB	Execution killed with signal 6
30	Halted	0 ms	0 KB	-

답안 #789144

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