oj.uz

답안 #639563

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
639563 2022-09-10T15:54:13 Z valerikk Monochrome Points (JOI20_monochrome) C++17
35 / 100
 2000 ms 37116 KB 
#include <bits/stdc++.h>

using namespace std;

struct Fenwick {
	int sz;
	vector<int> f;

	void add(int i, int val) {
		for (++i; i <= sz; i += i & -i) {
			f[i] += val;
		}
	}

	int get(int i) {
		int res = 0;
		for (; i > 0; i -= i & -i) {
			res += f[i];
		}
		return res;
	}

	Fenwick(int sz_) : sz(sz_) {
		f.resize(sz + 1, 0);
	}
};

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n;
	string s;
	cin >> n >> s;
	vector<int> black, white;
	for (int i = 0; i < 2 * n; ++i) {
		if (s[i] == 'W') {
			white.push_back(i);
		} else {
			black.push_back(i);
		}
	}
	sort(black.begin(), black.end());
	sort(white.begin(), white.end());
	auto get = [&](int k) {
		vector<vector<int>> start(2 * n + 1), finish(2 * n + 1);
		Fenwick fenw(2 * n);
		vector<pair<int, int>> segments;
		for (int i = 0; i < n; ++i) {
			int x = black[i], y = white[(i + k) % n];
			segments.push_back({min(x, y), max(x, y)});
		}
		for (int i = 0; i < n; ++i) {
			start[segments[i].first + 1].push_back(i);
			finish[segments[i].second].push_back(i);
		}
		long long res = 0;
		for (int i = 0; i < 2 * n; ++i) {
			for (int j : start[i]) {
				fenw.add(segments[j].first, 1);
			}
			for (int j : finish[i]) {
				fenw.add(segments[j].first, -1);
			}
			for (int j : finish[i]) {
				res += fenw.get(2 * n) - fenw.get(segments[j].first + 1);
			}
		}
		return res;
	};
	long long ans = 0;
	for (int k = 0; k < n; ++k) {
		ans = max(ans, get(k));
	}
	cout << ans << endl;
	return 0;
}

Subtask #1
4.0 / 4.0

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

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 15 ms 340 KB Output is correct
15 Correct 15 ms 340 KB Output is correct
16 Correct 16 ms 340 KB Output is correct
17 Correct 14 ms 340 KB Output is correct
18 Correct 10 ms 324 KB Output is correct
19 Correct 11 ms 372 KB Output is correct
20 Correct 11 ms 340 KB Output is correct
21 Correct 10 ms 340 KB Output is correct
22 Correct 10 ms 372 KB Output is correct
23 Correct 6 ms 320 KB Output is correct
24 Correct 10 ms 324 KB Output is correct
25 Correct 9 ms 320 KB Output is correct
26 Correct 10 ms 340 KB Output is correct
27 Correct 11 ms 368 KB Output is correct
28 Correct 13 ms 384 KB Output is correct
29 Correct 11 ms 372 KB Output is correct
30 Correct 10 ms 340 KB Output is correct
31 Correct 13 ms 324 KB Output is correct
32 Correct 14 ms 376 KB Output is correct
33 Correct 13 ms 384 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 15 ms 340 KB Output is correct
15 Correct 15 ms 340 KB Output is correct
16 Correct 16 ms 340 KB Output is correct
17 Correct 14 ms 340 KB Output is correct
18 Correct 10 ms 324 KB Output is correct
19 Correct 11 ms 372 KB Output is correct
20 Correct 11 ms 340 KB Output is correct
21 Correct 10 ms 340 KB Output is correct
22 Correct 10 ms 372 KB Output is correct
23 Correct 6 ms 320 KB Output is correct
24 Correct 10 ms 324 KB Output is correct
25 Correct 9 ms 320 KB Output is correct
26 Correct 10 ms 340 KB Output is correct
27 Correct 11 ms 368 KB Output is correct
28 Correct 13 ms 384 KB Output is correct
29 Correct 11 ms 372 KB Output is correct
30 Correct 10 ms 340 KB Output is correct
31 Correct 13 ms 324 KB Output is correct
32 Correct 14 ms 376 KB Output is correct
33 Correct 13 ms 384 KB Output is correct
34 Correct 699 ms 736 KB Output is correct
35 Correct 724 ms 756 KB Output is correct
36 Correct 665 ms 780 KB Output is correct
37 Correct 613 ms 1160 KB Output is correct
38 Correct 453 ms 596 KB Output is correct
39 Correct 517 ms 660 KB Output is correct
40 Correct 487 ms 656 KB Output is correct
41 Correct 418 ms 628 KB Output is correct
42 Correct 657 ms 752 KB Output is correct
43 Correct 547 ms 676 KB Output is correct
44 Correct 540 ms 688 KB Output is correct
45 Correct 521 ms 656 KB Output is correct
46 Correct 595 ms 668 KB Output is correct
47 Correct 545 ms 596 KB Output is correct
48 Correct 553 ms 716 KB Output is correct
49 Correct 499 ms 1192 KB Output is correct
50 Correct 558 ms 672 KB Output is correct
51 Correct 540 ms 684 KB Output is correct
52 Correct 618 ms 684 KB Output is correct

Subtask #4
0.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 15 ms 340 KB Output is correct
15 Correct 15 ms 340 KB Output is correct
16 Correct 16 ms 340 KB Output is correct
17 Correct 14 ms 340 KB Output is correct
18 Correct 10 ms 324 KB Output is correct
19 Correct 11 ms 372 KB Output is correct
20 Correct 11 ms 340 KB Output is correct
21 Correct 10 ms 340 KB Output is correct
22 Correct 10 ms 372 KB Output is correct
23 Correct 6 ms 320 KB Output is correct
24 Correct 10 ms 324 KB Output is correct
25 Correct 9 ms 320 KB Output is correct
26 Correct 10 ms 340 KB Output is correct
27 Correct 11 ms 368 KB Output is correct
28 Correct 13 ms 384 KB Output is correct
29 Correct 11 ms 372 KB Output is correct
30 Correct 10 ms 340 KB Output is correct
31 Correct 13 ms 324 KB Output is correct
32 Correct 14 ms 376 KB Output is correct
33 Correct 13 ms 384 KB Output is correct
34 Correct 699 ms 736 KB Output is correct
35 Correct 724 ms 756 KB Output is correct
36 Correct 665 ms 780 KB Output is correct
37 Correct 613 ms 1160 KB Output is correct
38 Correct 453 ms 596 KB Output is correct
39 Correct 517 ms 660 KB Output is correct
40 Correct 487 ms 656 KB Output is correct
41 Correct 418 ms 628 KB Output is correct
42 Correct 657 ms 752 KB Output is correct
43 Correct 547 ms 676 KB Output is correct
44 Correct 540 ms 688 KB Output is correct
45 Correct 521 ms 656 KB Output is correct
46 Correct 595 ms 668 KB Output is correct
47 Correct 545 ms 596 KB Output is correct
48 Correct 553 ms 716 KB Output is correct
49 Correct 499 ms 1192 KB Output is correct
50 Correct 558 ms 672 KB Output is correct
51 Correct 540 ms 684 KB Output is correct
52 Correct 618 ms 684 KB Output is correct
53 Execution timed out 2057 ms 37116 KB Time limit exceeded
54 Halted 0 ms 0 KB -