oj.uz

Submission #960899

# Submission time Handle Problem Language Result Execution time Memory
960899 2024-04-11T07:57:34 Z AlgorithmWarrior JJOOII 2 (JOI20_ho_t2) C++14
100 / 100
 11 ms 1408 KB 
#include <bits/stdc++.h>
#define MAX 200005

using namespace std;

int vj[MAX],vo[MAX],vi[MAX];

int main()
{
    int n,k;
    cin>>n>>k;
    int i;
    for(i=1;i<=n;++i)
    {
        char ch;
        cin>>ch;
        if(ch=='J')
            vj[++vj[0]]=i;
        if(ch=='O')
            vo[++vo[0]]=i;
        if(ch=='I')
            vi[++vi[0]]=i;
    }
    int pj,po=1,pi=1;
    int ans=1e9;
    for(pj=1;pj<=vj[0]-k+1;++pj)
    {
        while(po+k-1<=vo[0] && vo[po]<vj[pj+k-1])
            ++po;
        if(po+k-1<=vo[0])
        {
            while(pi+k-1<=vi[0] && vi[pi]<vo[po+k-1])
                ++pi;
            if(pi+k-1<=vi[0])
                ans=min(ans,vi[pi+k-1]-vj[pj]+1-3*k);
        }
    }
    if(ans<1e9)
        cout<<ans;
    else
        cout<<-1;
    return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
87.0 / 87.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 444 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 10 ms 1116 KB Output is correct
37 Correct 10 ms 1216 KB Output is correct
38 Correct 10 ms 1324 KB Output is correct
39 Correct 11 ms 1372 KB Output is correct
40 Correct 10 ms 1360 KB Output is correct
41 Correct 10 ms 1368 KB Output is correct
42 Correct 11 ms 1372 KB Output is correct
43 Correct 6 ms 924 KB Output is correct
44 Correct 7 ms 1116 KB Output is correct
45 Correct 10 ms 1372 KB Output is correct
46 Correct 10 ms 1224 KB Output is correct
47 Correct 10 ms 1368 KB Output is correct
48 Correct 10 ms 1368 KB Output is correct
49 Correct 7 ms 964 KB Output is correct
50 Correct 11 ms 1376 KB Output is correct
51 Correct 11 ms 1368 KB Output is correct
52 Correct 9 ms 1372 KB Output is correct
53 Correct 9 ms 1408 KB Output is correct
54 Correct 7 ms 1372 KB Output is correct
55 Correct 7 ms 1372 KB Output is correct
56 Correct 7 ms 1388 KB Output is correct