oj.uz

Submission #383164

# Submission time Handle Problem Language Result Execution time Memory
383164 2021-03-29T00:51:53 Z ScarletS JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 32 ms 3340 KB 
#include <bits/stdc++.h>
using namespace std;

int p[200001][3];

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

Subtask #1
1.0 / 1.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
87.0 / 87.0

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