oj.uz

답안 #876645

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
876645 2023-11-22T06:46:52 Z serifefedartar JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 6 ms 3620 KB 
#include <bits/stdc++.h>
using namespace std;

#define fast ios::sync_with_stdio(0);cin.tie(0);
#define s second
#define f first
typedef long long ll;
const ll MOD = 998244353;
const ll LOGN = 21;
const ll MAXN = 2e5 + 100;

string s;
int toJ[MAXN], toO[MAXN], toI[MAXN];
int main() {
	fast
	int N, K;
	cin >> N >> K >> s;
	s = "#" + s;

	int r = 1;
	int cnt = (s[1] == 'J');
	for (int l = 1; l <= N; l++) {
		while (cnt < K && r < N) {
			r++;
			if (s[r] == 'J')
				cnt++;
		}

		if (cnt == K)
			toJ[l] = r + 1;
		else
			toJ[l] = -1;
		if (s[l] == 'J')
			cnt--;
	}
	r = 1;
	cnt = (s[1] == 'O');
	for (int l = 1; l <= N; l++) {
		while (cnt < K && r < N) {
			r++;
			if (s[r] == 'O')
				cnt++;
		}

		if (cnt == K)
			toO[l] = r + 1;
		else
			toO[l] = -1;
		if (s[l] == 'O')
			cnt--;
	}
	r = 1;
	cnt = (s[1] == 'I');
	for (int l = 1; l <= N; l++) {
		while (cnt < K && r < N) {
			r++;
			if (s[r] == 'I')
				cnt++;
		}

		if (cnt == K)
			toI[l] = r + 1;
		else
			toI[l] = -1;
		if (s[l] == 'I')
			cnt--;
	}

	int ans = 1e9;
	for (int i = 1; i <= N; i++) {
		int now = toJ[i];
		if (now == -1 || now > N)
			continue;
		now = toO[now];
		if (now == -1 || now > N)
			continue;
		now = toI[now];
		if (now == -1)
			continue;
		ans = min(ans, now - i);
	}

	if (ans == 1e9)
		cout << "-1\n";
	else
		cout << ans - 3*K << "\n";
}

Subtask #1
1.0 / 1.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
87.0 / 87.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2508 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2512 KB Output is correct
6 Correct 0 ms 2392 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2504 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2424 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 0 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 0 ms 2396 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 0 ms 2396 KB Output is correct
36 Correct 4 ms 3120 KB Output is correct
37 Correct 6 ms 3164 KB Output is correct
38 Correct 4 ms 3108 KB Output is correct
39 Correct 5 ms 3152 KB Output is correct
40 Correct 5 ms 3320 KB Output is correct
41 Correct 5 ms 3108 KB Output is correct
42 Correct 6 ms 3132 KB Output is correct
43 Correct 4 ms 3160 KB Output is correct
44 Correct 4 ms 3024 KB Output is correct
45 Correct 5 ms 3096 KB Output is correct
46 Correct 5 ms 3108 KB Output is correct
47 Correct 5 ms 3108 KB Output is correct
48 Correct 4 ms 3108 KB Output is correct
49 Correct 3 ms 2916 KB Output is correct
50 Correct 5 ms 3236 KB Output is correct
51 Correct 5 ms 3108 KB Output is correct
52 Correct 2 ms 3244 KB Output is correct
53 Correct 3 ms 3108 KB Output is correct
54 Correct 3 ms 3620 KB Output is correct
55 Correct 2 ms 3108 KB Output is correct
56 Correct 3 ms 3108 KB Output is correct