oj.uz

Submission #255131

# Submission time Handle Problem Language Result Execution time Memory
255131 2020-07-31T10:08:47 Z AM1648 JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 33 ms 3212 KB 
/* be name khoda */
#include <bits/stdc++.h>
using namespace std;

typedef int ll;

#define forifrom(i, s, n) for (ll i = s; i < n; ++i)
#define fori(i, n) forifrom(i, 0, n)

// ------------------------------------------------------------------

const ll maxn = 200010;

ll n, k, cnt[3][maxn];
string S, C;

int main() {
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);

    cin >> n >> k >> S;
    S += '#';
    C = "JOI";
    fori (i, 3) fori (j, n + 1) cnt[i][j + 1] = cnt[i][j] + (S[j] == C[i]);
    ll ans = -1;
    fori (i, n) {
        ll i1 = lower_bound(cnt[0], cnt[0] + n + 1, k + cnt[0][i]) - cnt[0];
        ll i2 = lower_bound(cnt[1], cnt[1] + n + 1, k + cnt[1][i1]) - cnt[1];
        ll i3 = lower_bound(cnt[2], cnt[2] + n + 1, k + cnt[2][i2]) - cnt[2];
        if (i3 <= n) ans = max(ans, i + n - i3);
    }
    cout << (ans == -1 ? -1 : n - ans - k * 3) << '\n';

}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 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 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 256 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 436 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 436 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct

Subtask #3
87.0 / 87.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 256 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 436 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 436 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 29 ms 2956 KB Output is correct
37 Correct 29 ms 3212 KB Output is correct
38 Correct 29 ms 3212 KB Output is correct
39 Correct 27 ms 3212 KB Output is correct
40 Correct 24 ms 3212 KB Output is correct
41 Correct 26 ms 3212 KB Output is correct
42 Correct 28 ms 3212 KB Output is correct
43 Correct 14 ms 2176 KB Output is correct
44 Correct 17 ms 2572 KB Output is correct
45 Correct 22 ms 3212 KB Output is correct
46 Correct 23 ms 3212 KB Output is correct
47 Correct 22 ms 3212 KB Output is correct
48 Correct 22 ms 3212 KB Output is correct
49 Correct 14 ms 2316 KB Output is correct
50 Correct 29 ms 3212 KB Output is correct
51 Correct 23 ms 3212 KB Output is correct
52 Correct 18 ms 3084 KB Output is correct
53 Correct 33 ms 3212 KB Output is correct
54 Correct 20 ms 3212 KB Output is correct
55 Correct 18 ms 3212 KB Output is correct
56 Correct 16 ms 3212 KB Output is correct