oj.uz

Submission #540940

# Submission time Handle Problem Language Result Execution time Memory
540940 2022-03-22T03:10:34 Z Cookie197 JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 14 ms 2076 KB 
#include<iostream>
#include<vector>
#include<set>
#include<algorithm>
using namespace std;

#define ll long long
#define mp make_pair
#define endl "\n"
#define out(x) cout<< #x << " = " << x << endl

int n,k,J,O,I;
string s;
vector<int> v[3];
signed main(){
    cin>>n>>k>>s;
    v[0].push_back(0); v[1].push_back(0); v[2].push_back(0);
    for (int i=0;i<n;i++){
        if (s[i] == 'J') v[0].push_back(i+1), J++;
        if (s[i] == 'O') v[1].push_back(i+1), O++;
        if (s[i] == 'I') v[2].push_back(i+1), I++;
    }

    int ans = 1e9;
    for (int i=k;i<=J;i++){
        int opos = lower_bound(v[1].begin(),v[1].end(),v[0][i]) - v[1].begin();
        
        if (opos + k - 1 > O) continue;
        int oend = v[1][opos + k - 1];
        
        int ipos = lower_bound(v[2].begin(),v[2].end(),oend) - v[2].begin();
        if (ipos + k - 1 > I) continue;
        int iend = v[2][ipos + k - 1];
        
        ans = min(ans, iend - v[0][i-k+1] + 1 - k*3);
    }
    cout<<(ans == 1e9 ? -1 : ans)<<endl;
    
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 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 0 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 0 ms 296 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 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 0 ms 212 KB Output is correct
3 Correct 1 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 0 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 0 ms 296 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 296 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 296 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 296 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 300 KB Output is correct
35 Correct 1 ms 212 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 0 ms 212 KB Output is correct
3 Correct 1 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 0 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 0 ms 296 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 296 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 296 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 296 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 300 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 12 ms 1588 KB Output is correct
37 Correct 14 ms 1824 KB Output is correct
38 Correct 13 ms 1964 KB Output is correct
39 Correct 13 ms 1628 KB Output is correct
40 Correct 13 ms 1980 KB Output is correct
41 Correct 14 ms 1820 KB Output is correct
42 Correct 13 ms 2076 KB Output is correct
43 Correct 6 ms 1244 KB Output is correct
44 Correct 8 ms 1372 KB Output is correct
45 Correct 11 ms 1888 KB Output is correct
46 Correct 10 ms 1996 KB Output is correct
47 Correct 10 ms 1880 KB Output is correct
48 Correct 10 ms 1960 KB Output is correct
49 Correct 8 ms 1336 KB Output is correct
50 Correct 10 ms 1988 KB Output is correct
51 Correct 10 ms 1748 KB Output is correct
52 Correct 7 ms 1496 KB Output is correct
53 Correct 8 ms 1668 KB Output is correct
54 Correct 8 ms 1888 KB Output is correct
55 Correct 7 ms 1888 KB Output is correct
56 Correct 6 ms 1992 KB Output is correct