Submission #683856

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
683856	2023-01-19T13:47:26 Z	abc864197532	Monochrome Points (JOI20_monochrome)	C++17	4 / 100	1 ms	340 KB

monochrome

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define all(x) x.begin(), x.end()

int main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int n;
	string s;
	cin >> n >> s;
	vector <int> W, B;
	for (int i = 0; i < n; ++i) {
		if (s[i] == s[i + n]) {
			(s[i] == 'W' ? W : B).pb(i);
		}
	}
	int m = W.size();
	vector <vector <ll>> dp(m + 1, vector <ll> (m + 1, 1ll << 60));
	for (int i = 0; i <= m; ++i) {
		dp[i][i] = 0;
	}
	for (int len = 1; len <= m; ++len) {
		for (int i = 0; i + len <= m; ++i) {
			int j = i + len;
			{
				int cost = abs(W[len - 1] - B[i]);
				dp[i][j] = min(dp[i][j], dp[i + 1][j] + min(cost, n - cost));
			}
			{
				int cost = abs(W[len - 1] - B[j - 1]);
				dp[i][j] = min(dp[i][j], dp[i][j - 1] + min(cost, n - cost));
			}
		}
	}
	cout << 1ll * n * (n - 1) / 2 - dp[0][m] << '\n';
}

Subtask #1

4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	324 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	316 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	320 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	316 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	328 KB	Output is correct

Subtask #2

0.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	324 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	316 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	320 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	316 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	328 KB	Output is correct
14	Correct	1 ms	316 KB	Output is correct
15	Incorrect	1 ms	340 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #3

0.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	324 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	316 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	320 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	316 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	328 KB	Output is correct
14	Correct	1 ms	316 KB	Output is correct
15	Incorrect	1 ms	340 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #4

0.0 / 65.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	324 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	316 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	320 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	316 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	328 KB	Output is correct
14	Correct	1 ms	316 KB	Output is correct
15	Incorrect	1 ms	340 KB	Output isn't correct
16	Halted	0 ms	0 KB	-