oj.uz

Submission #748737

# Submission time Handle Problem Language Result Execution time Memory
748737 2023-05-26T20:26:19 Z Desh03 JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 15 ms 4716 KB 
#include <bits/stdc++.h>
using namespace std;

const int INF = 1e9;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n, k, ans = INF;
    cin >> n >> k;
    string s;
    cin >> s;
    vector<int> v(n);
    for (int i = 0; i < n; i++) v[i] = s[i] == 'J' ? 0 : s[i] == 'O' ? 1 : 2;
    vector<vector<int>> p(3, vector<int> (n + 1));
    for (int i = 0; i < 3; i++)
        for (int j = 0; j < n; j++)
            p[i][j + 1] = p[i][j] + (v[j] == i);
    for (int i = 0; i < n; i++) {
        if (v[i] == 0) {
            int s = i;
            for (int j = 0; j < 3; j++) {
                if (p[j][n] - p[j][s] < k) break;
                int l = s + 1, r = n;
                while (l < r) {
                    int m = l + r >> 1;
                    if (p[j][m] - p[j][s] < k) l = m + 1;
                    else r = m;
                }
                s = l;
                if (j == 2) ans = min(ans, s - i);
            }
        }
    }
    cout << (ans == INF ? -1 : ans - 3 * k) << '\n';
}

Compilation message

ho_t2.cpp: In function 'int main()':
ho_t2.cpp:26:31: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   26 |                     int m = l + r >> 1;
      |                             ~~^~~

Subtask #1
1.0 / 1.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
87.0 / 87.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 316 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 316 KB Output is correct
28 Correct 1 ms 320 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 9 ms 4444 KB Output is correct
37 Correct 9 ms 4704 KB Output is correct
38 Correct 9 ms 4704 KB Output is correct
39 Correct 14 ms 4676 KB Output is correct
40 Correct 10 ms 4704 KB Output is correct
41 Correct 14 ms 4692 KB Output is correct
42 Correct 15 ms 4704 KB Output is correct
43 Correct 5 ms 3020 KB Output is correct
44 Correct 7 ms 3680 KB Output is correct
45 Correct 9 ms 4692 KB Output is correct
46 Correct 9 ms 4704 KB Output is correct
47 Correct 8 ms 4716 KB Output is correct
48 Correct 8 ms 4704 KB Output is correct
49 Correct 5 ms 3264 KB Output is correct
50 Correct 8 ms 4704 KB Output is correct
51 Correct 9 ms 4704 KB Output is correct
52 Correct 5 ms 4564 KB Output is correct
53 Correct 5 ms 4696 KB Output is correct
54 Correct 9 ms 4704 KB Output is correct
55 Correct 6 ms 4704 KB Output is correct
56 Correct 4 ms 4692 KB Output is correct