oj.uz

Submission #1086506

# Submission time Handle Problem Language Result Execution time Memory
1086506 2024-09-10T19:39:46 Z toast12 JJOOII 2 (JOI20_ho_t2) C++14
100 / 100
 20 ms 3328 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
    int n, k;
    cin >> n >> k;
    string s;
    cin >> s;
    vector<int> jpos(n+1), opos(n+1), ipos(n+1);
    for (int l = 1; l <= n; l++) {
        jpos[l] = jpos[l-1], ipos[l] = ipos[l-1], opos[l] = opos[l-1];
        if (s[l-1] == 'J') jpos[l]++;
        if (s[l-1] == 'O') opos[l]++;
        if (s[l-1] == 'I') ipos[l]++;
    }
    int ans = INT_MAX;
    for (int j = 0; j < n; j++) {
        int x = j;
        int a = lower_bound(jpos.begin()+x, jpos.end(), jpos[x]+k) - jpos.begin();
        if (a > n) break;
        int b = lower_bound(opos.begin()+a, opos.end(), opos[a]+k) - opos.begin();
        if (b > n) break;
        int c = lower_bound(ipos.begin()+b, ipos.end(), ipos[b]+k) - ipos.begin();
        if (c > n) break;
        ans = min(ans, (c-x)-(3*k));
    }
    if (ans == INT_MAX) ans = -1;
    cout << ans << '\n';
    return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
87.0 / 87.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 436 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 16 ms 3052 KB Output is correct
37 Correct 18 ms 3304 KB Output is correct
38 Correct 17 ms 3304 KB Output is correct
39 Correct 17 ms 3052 KB Output is correct
40 Correct 8 ms 3308 KB Output is correct
41 Correct 14 ms 3316 KB Output is correct
42 Correct 20 ms 3308 KB Output is correct
43 Correct 3 ms 2028 KB Output is correct
44 Correct 4 ms 2540 KB Output is correct
45 Correct 6 ms 3308 KB Output is correct
46 Correct 7 ms 3328 KB Output is correct
47 Correct 6 ms 3304 KB Output is correct
48 Correct 5 ms 3308 KB Output is correct
49 Correct 4 ms 2284 KB Output is correct
50 Correct 5 ms 3300 KB Output is correct
51 Correct 6 ms 3308 KB Output is correct
52 Correct 5 ms 3208 KB Output is correct
53 Correct 5 ms 3308 KB Output is correct
54 Correct 8 ms 3308 KB Output is correct
55 Correct 6 ms 3300 KB Output is correct
56 Correct 5 ms 3308 KB Output is correct