Submission #208953

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
208953	2020-03-12T17:21:01 Z	AQT	JJOOII 2 (JOI20_ho_t2)	C++14	100 / 100	15 ms	3844 KB

ho_t2

#include <bits/stdc++.h>

using namespace std;

int N, K;
int lftmst[4][200005];
string s;
const string joi = "JOI";

int main(){
	cin.sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> N >> K >> s;
	for(int i = 1; i<=N; i++){
		lftmst[0][i] = i;
	}
	for(int t = 1; t<=3; t++){
		int cnt = 0;
		for(int l = 1, r = 1; r<=N; r++){
			if(s[r-1] == joi[t-1]){
				cnt++;
			}
			while(cnt > K){
				cnt -= (s[l-1] == joi[t-1]);
				l++;
			}
			while(cnt == K && l < r && s[l-1] != joi[t-1]){
				l++;
			}
			//cout << l << " " << r << "\n";
			if(cnt == K){
				lftmst[t][r] = lftmst[t-1][l];
			}
			//cout << lftmst[t][r] << " " << r << "\n";
		}
		//cout << "\n";
	}
	int rng = N+2;
	for(int i = 1; i<=N; i++){
		if(lftmst[3][i]) {
			rng = min(rng, i-lftmst[3][i]+1);
		}
	}
	if(rng == N+2){
		rng = -1;
	}
	else{
		rng -= 3*K;
	}
	cout << rng << "\n";
}

Subtask #1

1.0 / 1.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	376 KB	Output is correct
2	Correct	4 ms	248 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	248 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Correct	6 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	5 ms	376 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	4 ms	248 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	248 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Correct	6 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	5 ms	376 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	5 ms	376 KB	Output is correct
20	Correct	5 ms	248 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	504 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	4 ms	248 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	248 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Correct	6 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	5 ms	376 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	5 ms	376 KB	Output is correct
20	Correct	5 ms	248 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	504 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	10 ms	3588 KB	Output is correct
37	Correct	11 ms	3716 KB	Output is correct
38	Correct	11 ms	3844 KB	Output is correct
39	Correct	13 ms	3588 KB	Output is correct
40	Correct	12 ms	3204 KB	Output is correct
41	Correct	15 ms	3460 KB	Output is correct
42	Correct	13 ms	3716 KB	Output is correct
43	Correct	10 ms	2044 KB	Output is correct
44	Correct	10 ms	2436 KB	Output is correct
45	Correct	12 ms	2948 KB	Output is correct
46	Correct	12 ms	2948 KB	Output is correct
47	Correct	12 ms	2948 KB	Output is correct
48	Correct	12 ms	3076 KB	Output is correct
49	Correct	9 ms	2180 KB	Output is correct
50	Correct	12 ms	3072 KB	Output is correct
51	Correct	12 ms	2948 KB	Output is correct
52	Correct	11 ms	1668 KB	Output is correct
53	Correct	10 ms	1796 KB	Output is correct
54	Correct	8 ms	2948 KB	Output is correct
55	Correct	7 ms	2436 KB	Output is correct
56	Correct	7 ms	2180 KB	Output is correct