oj.uz

Submission #390747

# Submission time Handle Problem Language Result Execution time Memory
390747 2021-04-16T20:41:34 Z timmyfeng JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 9 ms 2944 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 200001;

int nxt[3][N];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, k;
    string s;
    cin >> n >> k >> s;

    for (int i = 0; i < 3; ++i) {
        int count = 0;
        for (int l = 0, r = 0; l < n; ++l) {
            while (count < k && r < n) {
                count += s[r++] == "JOI"[i];
            }
            nxt[i][l] = r + (count < k);
            count -= s[l] == "JOI"[i];
        }
        nxt[i][n] = n + 1;
    }

    int ans = n + 1;
    for (int l = 0; l < n; ++l) {
        int r = l;
        for (int i = 0; i < 3 && r <= n; ++i) {
            r = nxt[i][r];
        }
        if (r <= n) {
            ans = min(ans, r - l - 3 * k);
        }
    }

    cout << (ans <= n ? ans : -1) << "\n";
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct

Subtask #3
87.0 / 87.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 7 ms 2824 KB Output is correct
37 Correct 7 ms 2904 KB Output is correct
38 Correct 7 ms 2904 KB Output is correct
39 Correct 9 ms 2908 KB Output is correct
40 Correct 8 ms 2904 KB Output is correct
41 Correct 8 ms 2944 KB Output is correct
42 Correct 9 ms 2904 KB Output is correct
43 Correct 6 ms 1996 KB Output is correct
44 Correct 6 ms 2396 KB Output is correct
45 Correct 8 ms 2904 KB Output is correct
46 Correct 8 ms 2920 KB Output is correct
47 Correct 7 ms 2904 KB Output is correct
48 Correct 7 ms 2904 KB Output is correct
49 Correct 5 ms 2136 KB Output is correct
50 Correct 7 ms 2904 KB Output is correct
51 Correct 8 ms 2900 KB Output is correct
52 Correct 5 ms 2904 KB Output is correct
53 Correct 5 ms 2904 KB Output is correct
54 Correct 4 ms 2904 KB Output is correct
55 Correct 4 ms 2904 KB Output is correct
56 Correct 4 ms 2904 KB Output is correct