oj.uz

Submission #740379

# Submission time Handle Problem Language Result Execution time Memory
740379 2023-05-12T11:51:52 Z tch1cherin JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 12 ms 3192 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
  int N, K;
  cin >> N >> K;
  string S;
  cin >> S;
  vector<int> J(N, N + 1), O(N, N + 1), I(N, N + 1);
  for (int l = 0, r = 0, c = 0; l < N; l++) {
    while (r < N && c < K) {
      c += S[r] == 'J';
      r++; 
    }
    J[l] = (c == K ? r : N + 1);
    c -= S[l] == 'J';
  }
  for (int l = 0, r = 0, c = 0; l < N; l++) {
    while (r < N && c < K) {
      c += S[r] == 'O';
      r++; 
    }
    O[l] = (c == K ? r : N + 1);
    c -= S[l] == 'O';
  }
  for (int l = 0, r = 0, c = 0; l < N; l++) {
    while (r < N && c < K) {
      c += S[r] == 'I';
      r++; 
    }
    I[l] = (c == K ? r : N + 1);
    c -= S[l] == 'I';
  }
  int ans = N + 1;
  for (int i = 0; i < N; i++) {
    if (J[i] >= N || O[J[i]] >= N || I[O[J[i]]] > N) {
      continue;
    }
    ans = min(ans, I[O[J[i]]] - i - 3 * K);
  }
  cout << (ans == N + 1 ? -1 : ans) << "\n";
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 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 212 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 1 ms 304 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 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 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 212 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 1 ms 304 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 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 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 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 300 KB Output is correct
26 Correct 1 ms 300 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 300 KB Output is correct
29 Correct 1 ms 300 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 300 KB Output is correct
33 Correct 1 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 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 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 212 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 1 ms 304 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 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 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 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 300 KB Output is correct
26 Correct 1 ms 300 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 300 KB Output is correct
29 Correct 1 ms 300 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 300 KB Output is correct
33 Correct 1 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 10 ms 2916 KB Output is correct
37 Correct 12 ms 3076 KB Output is correct
38 Correct 10 ms 3172 KB Output is correct
39 Correct 11 ms 3044 KB Output is correct
40 Correct 10 ms 3172 KB Output is correct
41 Correct 11 ms 3140 KB Output is correct
42 Correct 11 ms 3180 KB Output is correct
43 Correct 7 ms 2116 KB Output is correct
44 Correct 10 ms 2492 KB Output is correct
45 Correct 10 ms 3172 KB Output is correct
46 Correct 10 ms 3140 KB Output is correct
47 Correct 11 ms 3140 KB Output is correct
48 Correct 11 ms 3148 KB Output is correct
49 Correct 7 ms 2148 KB Output is correct
50 Correct 10 ms 3180 KB Output is correct
51 Correct 10 ms 3148 KB Output is correct
52 Correct 8 ms 3044 KB Output is correct
53 Correct 8 ms 3172 KB Output is correct
54 Correct 8 ms 3192 KB Output is correct
55 Correct 7 ms 3168 KB Output is correct
56 Correct 7 ms 3172 KB Output is correct