oj.uz

Submission #254877

# Submission time Handle Problem Language Result Execution time Memory
254877 2020-07-30T19:12:06 Z imeimi2000 JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 33 ms 2044 KB 
#include <bits/stdc++.h>

using namespace std;

int n, k;
char S[200002];
vector<int> P[4];
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> k >> S + 1;
    for (int i = 1; i <= n; ++i) {
        P[S[i] == 'J' ? 1 : S[i] == 'O' ? 2 : 3].push_back(i);
    }
    int ans = n + 1;
    for (int s = 1; s <= n; ++s) {
        int e = s;
        for (int i = 1; i <= 3; ++i) {
            auto it = lower_bound(P[i].begin(), P[i].end(), e);
            if (int(P[i].end() - it) < k) {
                e = 10 * n;
                break;
            }
            e = *(it + (k - 1));
        }
        ans = min(ans, (e - s + 1) - 3 * k);
    }
    printf("%d\n", ans > n ? -1 : ans);
    return 0;
}

Compilation message

ho_t2.cpp: In function 'int main()':
ho_t2.cpp:10:24: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     cin >> n >> k >> S + 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 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 1 ms 384 KB Output is correct
9 Correct 1 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 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 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 1 ms 384 KB Output is correct
9 Correct 1 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 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 384 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 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 1 ms 384 KB Output is correct
9 Correct 1 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 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 384 KB Output is correct
36 Correct 31 ms 1528 KB Output is correct
37 Correct 33 ms 1912 KB Output is correct
38 Correct 33 ms 2024 KB Output is correct
39 Correct 30 ms 2040 KB Output is correct
40 Correct 25 ms 2008 KB Output is correct
41 Correct 28 ms 2024 KB Output is correct
42 Correct 33 ms 1912 KB Output is correct
43 Correct 13 ms 1280 KB Output is correct
44 Correct 17 ms 1512 KB Output is correct
45 Correct 22 ms 1912 KB Output is correct
46 Correct 23 ms 1912 KB Output is correct
47 Correct 22 ms 2040 KB Output is correct
48 Correct 23 ms 2040 KB Output is correct
49 Correct 15 ms 1280 KB Output is correct
50 Correct 23 ms 2036 KB Output is correct
51 Correct 24 ms 2040 KB Output is correct
52 Correct 13 ms 1720 KB Output is correct
53 Correct 14 ms 1784 KB Output is correct
54 Correct 14 ms 2044 KB Output is correct
55 Correct 11 ms 2044 KB Output is correct
56 Correct 11 ms 2044 KB Output is correct