oj.uz

Submission #276090

# Submission time Handle Problem Language Result Execution time Memory
276090 2020-08-20T10:41:55 Z islingr JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 31 ms 3212 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;
	rep(i, 0, n) {
		cj[i + 1] = cj[i];
		co[i + 1] = co[i];
		ci[i + 1] = ci[i];
		if (s[i] == 'J') ++cj[i + 1];
		if (s[i] == 'O') ++co[i + 1];
		if (s[i] == 'I') ++ci[i + 1];
	}
	rep(l, 0, n) {
		int j = lb(cj + l, cj + n + 1, cj[l] + k) - cj;
		int o = lb(co + j, co + n + 1, co[j] + k) - co;
		int i = lb(ci + o, ci + n + 1, ci[o] + k) - ci;
		if (i == n + 1) break;
		res = min(res, i - l - 3 * k);
	}
	cout << (res < inf ? res : -1);
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 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 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 416 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 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 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 416 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 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 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 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 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 396 KB Output is correct

Subtask #3
87.0 / 87.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 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 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 416 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 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 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 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 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 396 KB Output is correct
36 Correct 21 ms 2872 KB Output is correct
37 Correct 24 ms 3072 KB Output is correct
38 Correct 22 ms 3152 KB Output is correct
39 Correct 26 ms 3100 KB Output is correct
40 Correct 9 ms 3068 KB Output is correct
41 Correct 20 ms 3212 KB Output is correct
42 Correct 31 ms 3072 KB Output is correct
43 Correct 3 ms 2048 KB Output is correct
44 Correct 4 ms 2432 KB Output is correct
45 Correct 4 ms 3072 KB Output is correct
46 Correct 4 ms 3072 KB Output is correct
47 Correct 4 ms 3072 KB Output is correct
48 Correct 4 ms 3072 KB Output is correct
49 Correct 3 ms 2176 KB Output is correct
50 Correct 5 ms 3072 KB Output is correct
51 Correct 4 ms 3072 KB Output is correct
52 Correct 4 ms 2944 KB Output is correct
53 Correct 5 ms 3072 KB Output is correct
54 Correct 13 ms 3072 KB Output is correct
55 Correct 6 ms 3072 KB Output is correct
56 Correct 5 ms 3072 KB Output is correct