답안 #509969

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
509969	2022-01-14T12:58:59 Z	CSQ31	JJOOII 2 (JOI20_ho_t2)	C++17	100 / 100	13 ms	2376 KB

ho_t2

#include <bits/stdc++.h>
using namespace std;
int p[200001],q[200001];
int main()
{
	int n,k;
	string s;
	cin>>n>>k>>s;
	int cnt = 0;
	for(int l=0,r=0;r<n;r++){
		cnt+=s[r] == 'J';
		while(cnt >= k){
			if(cnt==k && s[l] == 'J')break;
			cnt-=s[l] == 'J';
			l++;
		}
		if(cnt == k)p[r] = r-l+1 - k;
		else p[r] = -1;
	}
	
	cnt = 0;
	for(int l=n-1,r=n-1;l>=0;l--){
		cnt+=s[l] == 'I';
		while(cnt >= k){
			if(cnt==k && s[r] == 'I')break;
			cnt-=s[r] == 'I';
			r--;
		}
		if(cnt == k)q[l] = r-l+1 - k;
		else q[l] = -1;
	}
	int ans = 1e9;
	cnt = 0;
	for(int l=0,r=0;r<n;r++){
		cnt+=s[r] == 'O';
		while(cnt >= k){
			if(cnt==k && s[l] == 'O')break;
			cnt-=s[l] == 'O';
			l++;
		}
		if(l && p[l-1] != -1 && r+1<n && q[r+1] != -1 && cnt == k){
			ans = min(ans,p[l-1] + q[r+1] + r-l+1-cnt);
		}
	}
	if(ans == 1e9)ans = -1;
	cout<<ans;

	
}

Subtask #1

1.0 / 1.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	296 KB	Output is correct
2	Correct	0 ms	304 KB	Output is correct
3	Correct	0 ms	296 KB	Output is correct
4	Correct	0 ms	304 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	300 KB	Output is correct
11	Correct	0 ms	296 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct

Subtask #2

12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	296 KB	Output is correct
2	Correct	0 ms	304 KB	Output is correct
3	Correct	0 ms	296 KB	Output is correct
4	Correct	0 ms	304 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	300 KB	Output is correct
11	Correct	0 ms	296 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	1 ms	292 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	0 ms	332 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	300 KB	Output is correct
23	Correct	0 ms	204 KB	Output is correct
24	Correct	1 ms	296 KB	Output is correct
25	Correct	0 ms	300 KB	Output is correct
26	Correct	0 ms	332 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	1 ms	332 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	1 ms	332 KB	Output is correct
31	Correct	0 ms	204 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	1 ms	284 KB	Output is correct
34	Correct	0 ms	332 KB	Output is correct
35	Correct	1 ms	332 KB	Output is correct

Subtask #3

87.0 / 87.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	296 KB	Output is correct
2	Correct	0 ms	304 KB	Output is correct
3	Correct	0 ms	296 KB	Output is correct
4	Correct	0 ms	304 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	300 KB	Output is correct
11	Correct	0 ms	296 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	1 ms	292 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	0 ms	332 KB	Output is correct
20	Correct	1 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	300 KB	Output is correct
23	Correct	0 ms	204 KB	Output is correct
24	Correct	1 ms	296 KB	Output is correct
25	Correct	0 ms	300 KB	Output is correct
26	Correct	0 ms	332 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	1 ms	332 KB	Output is correct
29	Correct	1 ms	332 KB	Output is correct
30	Correct	1 ms	332 KB	Output is correct
31	Correct	0 ms	204 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	1 ms	284 KB	Output is correct
34	Correct	0 ms	332 KB	Output is correct
35	Correct	1 ms	332 KB	Output is correct
36	Correct	9 ms	2136 KB	Output is correct
37	Correct	10 ms	2276 KB	Output is correct
38	Correct	9 ms	2240 KB	Output is correct
39	Correct	11 ms	2256 KB	Output is correct
40	Correct	10 ms	2268 KB	Output is correct
41	Correct	13 ms	2328 KB	Output is correct
42	Correct	11 ms	2268 KB	Output is correct
43	Correct	6 ms	1608 KB	Output is correct
44	Correct	8 ms	1884 KB	Output is correct
45	Correct	9 ms	2268 KB	Output is correct
46	Correct	9 ms	2272 KB	Output is correct
47	Correct	9 ms	2264 KB	Output is correct
48	Correct	9 ms	2372 KB	Output is correct
49	Correct	6 ms	1608 KB	Output is correct
50	Correct	9 ms	2236 KB	Output is correct
51	Correct	9 ms	2376 KB	Output is correct
52	Correct	6 ms	2244 KB	Output is correct
53	Correct	7 ms	2272 KB	Output is correct
54	Correct	6 ms	2324 KB	Output is correct
55	Correct	6 ms	2260 KB	Output is correct
56	Correct	6 ms	2260 KB	Output is correct