oj.uz

Submission #955154

# Submission time Handle Problem Language Result Execution time Memory
955154 2024-03-29T13:35:46 Z ililog JJOOII 2 (JOI20_ho_t2) C++11
100 / 100
 6 ms 3304 KB 
using namespace std;
#include<iostream>
#include<fstream>

int vj[200001], vo[200001], vi[200001];
int lj, lo, li;
int n, k;
string s;

int main() {
    cin >> n >> k;
    cin >> s;
    for (int i = 0; i<n; i++) {
        if (s[i] == 'J') {
            vj[++lj] = i;
        } else if (s[i] == 'O') {
            vo[++lo] = i;
        } else {
            vi[++li] = i;
        }
    }
    
    int pj = 1, po = 1, pi = 1, minim = n+1;
    while (pj + k - 1 <= lj && po + k - 1 <= lo && pi + k - 1 <= li) {
        while (po + k - 1 <= lo && vo[po] <= vj[pj+k-1]) po++;
        
        if (po + k - 1 <= lo) {
            while (pi + k - 1 <= li && vi[pi] <= vo[po+k-1]) pi++;
            
            if (pj + k - 1 <= lj && po + k - 1 <= lo && pi + k - 1 <= li) {
                int st = vj[pj];
                int dr = vi[pi+k-1];
                minim = min(minim, dr-st+1-3*k);
            }
        }
        pj++;
    }
    
    if (minim == n+1) {
        cout << "-1";
    } else {
        cout << minim;
    }
    
    return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2648 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2496 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
87.0 / 87.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2648 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2496 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2408 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2648 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2392 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2492 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 2488 KB Output is correct
36 Correct 5 ms 3048 KB Output is correct
37 Correct 6 ms 3304 KB Output is correct
38 Correct 6 ms 3048 KB Output is correct
39 Correct 5 ms 3048 KB Output is correct
40 Correct 5 ms 3052 KB Output is correct
41 Correct 5 ms 3160 KB Output is correct
42 Correct 6 ms 3052 KB Output is correct
43 Correct 3 ms 2796 KB Output is correct
44 Correct 4 ms 3052 KB Output is correct
45 Correct 5 ms 3052 KB Output is correct
46 Correct 5 ms 3052 KB Output is correct
47 Correct 5 ms 3052 KB Output is correct
48 Correct 5 ms 3048 KB Output is correct
49 Correct 4 ms 3048 KB Output is correct
50 Correct 5 ms 3052 KB Output is correct
51 Correct 5 ms 3052 KB Output is correct
52 Correct 4 ms 3024 KB Output is correct
53 Correct 5 ms 3052 KB Output is correct
54 Correct 4 ms 3052 KB Output is correct
55 Correct 4 ms 3052 KB Output is correct
56 Correct 4 ms 3052 KB Output is correct