oj.uz

Submission #997069

# Submission time Handle Problem Language Result Execution time Memory
997069 2024-06-11T16:53:36 Z goduadzesaba JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 7 ms 2272 KB 
#include <bits/stdc++.h>
using namespace std;
const int N=2e5+5;
int n,k,ans,d,x,y; string s;
vector <int> j,o,_i;
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
	cin>>n>>k>>s;
	for (int i=0; i<n; i++){
		if (s[i]=='J'){
			j.push_back(i+1);
		}
		if (s[i]=='O'){
			o.push_back(i+1);
		}
		if (s[i]=='I'){
			_i.push_back(i+1);
		}
	} ans=1e9;
	for (int i=0; i<(int)o.size()-k+1; i++){
		x=lower_bound(j.begin(),j.end(),o[i])-1-j.begin();
		y=lower_bound(_i.begin(),_i.end(),o[i+k-1])-_i.begin();
		if (x<k-1) continue;
		if (y>(int)_i.size()-k) continue;
		ans=min(ans,_i[y+k-1]-j[x-k+1]+1-3*k);
	}
	cout<<(ans<1e9?ans:-1);
}

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 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 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 348 KB Output is correct
14 Correct 0 ms 348 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 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 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 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 456 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 0 ms 456 KB Output is correct
35 Correct 1 ms 344 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 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 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 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 456 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 0 ms 456 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 7 ms 1748 KB Output is correct
37 Correct 7 ms 1832 KB Output is correct
38 Correct 7 ms 1988 KB Output is correct
39 Correct 7 ms 2016 KB Output is correct
40 Correct 6 ms 2016 KB Output is correct
41 Correct 6 ms 1932 KB Output is correct
42 Correct 7 ms 2040 KB Output is correct
43 Correct 4 ms 1400 KB Output is correct
44 Correct 4 ms 1424 KB Output is correct
45 Correct 6 ms 2012 KB Output is correct
46 Correct 6 ms 2008 KB Output is correct
47 Correct 7 ms 2272 KB Output is correct
48 Correct 6 ms 2052 KB Output is correct
49 Correct 4 ms 1472 KB Output is correct
50 Correct 6 ms 1928 KB Output is correct
51 Correct 6 ms 2016 KB Output is correct
52 Correct 3 ms 1632 KB Output is correct
53 Correct 4 ms 1748 KB Output is correct
54 Correct 4 ms 2020 KB Output is correct
55 Correct 3 ms 2020 KB Output is correct
56 Correct 2 ms 2020 KB Output is correct