oj.uz

답안 #793991

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
793991 2023-07-26T08:31:00 Z acatmeowmeow JJOOII 2 (JOI20_ho_t2) C++11
100 / 100
 26 ms 5500 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long 

const int N = 2e5;
int n, k, prefix[3][N + 5];

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n >> k;
	string s;
	cin >> s;
	while (s.size() && s.back() != 'I') s.pop_back();
	reverse(s.begin(), s.end());
	while (s.size() && s.back() != 'J') s.pop_back();
	reverse(s.begin(), s.end());
	n = s.size();
	for (int i = 1; i <= n; i++) {
		int v = s[i - 1] == 'J' ? 0 : (s[i - 1] == 'O' ? 1 : 2);
		prefix[v][i]++;
		for (int j = 0; j < 3; j++) prefix[j][i] += prefix[j][i - 1];
	}
	int ans = 1e18;
	for (int i = 1; i <= n; i++) {
		int l = 1, r = i, lefO = -1;
		while(l <= r) {
			int m = (l + r)/2;
			if (prefix[1][i] - prefix[1][m - 1] >= k) lefO = m, l = m + 1;
			else r = m - 1;
		}
		if (lefO == -1) continue;
		l = 1, r = lefO - 1;
	    int	lefJ = -1;
		while (l <= r) {
			int m = (l + r)/2;
			if (prefix[0][lefO - 1] - prefix[0][m - 1] >= k) lefJ = m, l = m + 1;
			else r = m - 1;
		}
		if (lefJ == -1) continue;
		l = i + 1, r = n;
		int rigI = -1;
		while (l <= r) {
			int m = (l + r)/2;
			if (prefix[2][m] - prefix[2][i] >= k) rigI = m, r = m - 1;
			else l = m + 1;
		}
		if (rigI == -1) continue;
		ans = min(ans, rigI - lefJ + 1 - 3*k);
	}
	cout << (ans == 1e18 ? -1 : ans) << '\n';
	return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
87.0 / 87.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 324 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 352 KB Output is correct
16 Correct 1 ms 324 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 324 KB Output is correct
22 Correct 1 ms 328 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 356 KB Output is correct
28 Correct 1 ms 328 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 328 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 26 ms 5100 KB Output is correct
37 Correct 20 ms 5472 KB Output is correct
38 Correct 20 ms 5472 KB Output is correct
39 Correct 22 ms 5472 KB Output is correct
40 Correct 15 ms 5472 KB Output is correct
41 Correct 20 ms 5472 KB Output is correct
42 Correct 24 ms 5472 KB Output is correct
43 Correct 11 ms 3540 KB Output is correct
44 Correct 10 ms 4408 KB Output is correct
45 Correct 15 ms 5500 KB Output is correct
46 Correct 14 ms 5472 KB Output is correct
47 Correct 14 ms 5472 KB Output is correct
48 Correct 15 ms 5472 KB Output is correct
49 Correct 8 ms 3764 KB Output is correct
50 Correct 12 ms 5440 KB Output is correct
51 Correct 12 ms 5472 KB Output is correct
52 Correct 7 ms 5344 KB Output is correct
53 Correct 7 ms 5476 KB Output is correct
54 Correct 15 ms 5468 KB Output is correct
55 Correct 13 ms 5472 KB Output is correct
56 Correct 9 ms 5472 KB Output is correct