답안 #276804

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
276804 2020-08-20T16:49:31 Z islingr JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
7 ms 768 KB
#include <bits/stdc++.h>
using namespace std;
 
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define per(i, a, b) for (auto i = (b); i-- > (a); )
#define lb(x...) lower_bound(x)
#define ub(x...) upper_bound(x)
 
const int N = 1 << 18, inf = 1e9;
char s[N];
int ci[N], co[N], cj[N];
 
signed main() {
	cin.tie(nullptr)->sync_with_stdio(false);
 
	int n, k, res = inf; cin >> n >> k >> s;
	for (int l = 0, j = 0, o = 0, i = 0, cj = 0, co = 0, ci = 0; l < n; ++l) {
		while (j < n && cj < k) {
			if (s[j] == 'J') ++cj;
			if (s[j] == 'O') --co;
			++j;
		}
		while (o < n && co < k) {
			if (s[o] == 'O') ++co;
			if (s[o] == 'I') --ci;
			++o;
		}
		while (i < n && ci < k) if (s[i++] == 'I') ++ci;
		if (ci != k) break;
		res = min(res, i - l - 3 * k);
		if (s[l] == 'J') --cj;
	}
	cout << (res < inf ? res : -1);
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 288 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 288 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 288 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 5 ms 768 KB Output is correct
37 Correct 6 ms 768 KB Output is correct
38 Correct 5 ms 768 KB Output is correct
39 Correct 6 ms 768 KB Output is correct
40 Correct 4 ms 768 KB Output is correct
41 Correct 5 ms 768 KB Output is correct
42 Correct 7 ms 760 KB Output is correct
43 Correct 2 ms 632 KB Output is correct
44 Correct 3 ms 760 KB Output is correct
45 Correct 5 ms 768 KB Output is correct
46 Correct 3 ms 768 KB Output is correct
47 Correct 3 ms 768 KB Output is correct
48 Correct 4 ms 768 KB Output is correct
49 Correct 2 ms 660 KB Output is correct
50 Correct 3 ms 768 KB Output is correct
51 Correct 3 ms 760 KB Output is correct
52 Correct 4 ms 768 KB Output is correct
53 Correct 4 ms 768 KB Output is correct
54 Correct 2 ms 768 KB Output is correct
55 Correct 2 ms 768 KB Output is correct
56 Correct 2 ms 768 KB Output is correct