oj.uz

Submission #627714

# Submission time Handle Problem Language Result Execution time Memory
627714 2022-08-12T19:40:39 Z Abrar_Al_Samit JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 24 ms 3124 KB 
#include<bits/stdc++.h>
using namespace std;

const int MX = 2e5 + 5;

int prej[MX], preo[MX], prei[MX];

int get(int l, int r, int *a) {
  if(l>r) return 0;
  return a[r] - a[l-1];
}
string s;
void PlayGround() {
  int n, k;
  cin>>n>>k;
  cin>>s;
  s = "$" + s;

  for(int i=1; i<=n; ++i) {
    if(s[i]=='J') prej[i] = 1;
    else if(s[i]=='O') preo[i] = 1;
    else prei[i] = 1;

    prej[i] += prej[i-1];
    preo[i] += preo[i-1];
    prei[i] += prei[i-1];
  }

  int ans = INT_MAX;
  for(int i=1; i<=n; ++i) {
    int j = i;
    if(get(j, n, prej)<k) break;
    int l = i, r = n;
    while(l<r) {
      int mid = (l+r)/2;
      if(get(j, mid, prej)>=k) r = mid;
      else l = mid+1;
    }
    ++l, r = n, j = l;
    if(get(j, n, preo)<k) break;
    while(l<r) {
      int mid = (l+r)/2;
      if(get(j, mid, preo)>=k) r = mid;
      else l = mid+1;
    }
    ++l, r = n, j = l;
    if(get(j, n, prei)<k) break;
    while(l<r) {
      int mid = (l+r)/2;
      if(get(j, mid, prei)>=k) r = mid;
      else l = mid+1;
    }
    ans = min(ans, l-i+1 - k*3);
  }
  if(ans==INT_MAX) ans = -1;
  cout<<ans<<'\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  PlayGround();
  return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 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 328 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 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 328 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 336 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 340 KB Output is correct
21 Correct 1 ms 328 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 340 KB Output is correct
28 Correct 1 ms 328 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 324 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct

Subtask #3
87.0 / 87.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 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 328 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 336 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 340 KB Output is correct
21 Correct 1 ms 328 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 340 KB Output is correct
28 Correct 1 ms 328 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 324 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 23 ms 2984 KB Output is correct
37 Correct 20 ms 3120 KB Output is correct
38 Correct 19 ms 3104 KB Output is correct
39 Correct 21 ms 3100 KB Output is correct
40 Correct 9 ms 3120 KB Output is correct
41 Correct 18 ms 3100 KB Output is correct
42 Correct 24 ms 3100 KB Output is correct
43 Correct 3 ms 2176 KB Output is correct
44 Correct 3 ms 2484 KB Output is correct
45 Correct 3 ms 3124 KB Output is correct
46 Correct 4 ms 3100 KB Output is correct
47 Correct 4 ms 3100 KB Output is correct
48 Correct 3 ms 3100 KB Output is correct
49 Correct 3 ms 2144 KB Output is correct
50 Correct 4 ms 3100 KB Output is correct
51 Correct 4 ms 3100 KB Output is correct
52 Correct 4 ms 3084 KB Output is correct
53 Correct 4 ms 3104 KB Output is correct
54 Correct 8 ms 3100 KB Output is correct
55 Correct 5 ms 3084 KB Output is correct
56 Correct 3 ms 3100 KB Output is correct