oj.uz

Submission #201460

# Submission time Handle Problem Language Result Execution time Memory
201460 2020-02-10T16:01:12 Z Alexa2001 JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 18 ms 3064 KB 
#include <bits/stdc++.h>

using namespace std;

const int Nmax = 2e5 + 5;

int sI[Nmax], sJ[Nmax], sO[Nmax], N, K;
char a[Nmax];

int main()
{
  //  freopen("input", "r", stdin);
    cin.sync_with_stdio(false); cin.tie(0);

    cin >> N >> K;
    cin >> (a+1);
    
    int s, i, j, k, ans = 1e9;
    
    for(i=1; i<=N; ++i) sJ[i] = sJ[i-1] + (a[i] == 'J');
    for(i=1; i<=N; ++i) sO[i] = sO[i-1] + (a[i] == 'O');
    for(i=1; i<=N; ++i) sI[i] = sI[i-1] + (a[i] == 'I');

    i = j = k = 0;
    for(s=0; s<N; ++s)
    {
        while(i <= N && sJ[i] - sJ[s] < K) ++i;
        while(j <= N && sO[j] - sO[i] < K) ++j;
        while(k <= N && sI[k] - sI[j] < K) ++k;

        if(i <= N && j <= N && k <= N && k - s < ans) 
            ans = k - s;
    }
    
    ans -= 3 * K;
    if(ans > N) ans = -1;
    cout << ans << '\n';

    return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
87.0 / 87.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 4 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 4 ms 252 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 6 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 5 ms 376 KB Output is correct
32 Correct 5 ms 376 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 11 ms 2680 KB Output is correct
37 Correct 12 ms 2936 KB Output is correct
38 Correct 12 ms 2808 KB Output is correct
39 Correct 12 ms 2808 KB Output is correct
40 Correct 11 ms 3064 KB Output is correct
41 Correct 12 ms 2808 KB Output is correct
42 Correct 12 ms 2808 KB Output is correct
43 Correct 8 ms 1912 KB Output is correct
44 Correct 9 ms 2296 KB Output is correct
45 Correct 11 ms 2940 KB Output is correct
46 Correct 10 ms 2808 KB Output is correct
47 Correct 10 ms 2808 KB Output is correct
48 Correct 18 ms 2812 KB Output is correct
49 Correct 8 ms 2040 KB Output is correct
50 Correct 10 ms 2808 KB Output is correct
51 Correct 10 ms 2808 KB Output is correct
52 Correct 10 ms 2808 KB Output is correct
53 Correct 10 ms 2808 KB Output is correct
54 Correct 10 ms 2808 KB Output is correct
55 Correct 9 ms 2808 KB Output is correct
56 Correct 10 ms 2808 KB Output is correct