oj.uz

답안 #256941

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
256941 2020-08-03T12:24:51 Z akat JJOOII 2 (JOI20_ho_t2) C++14
100 / 100
 10 ms 1548 KB 
#include<bits/stdc++.h>
using namespace std;
string s;
int k;
deque<int> d[3];
char c[3] = {'J', 'O', 'I'};
int last[3];
void rem(int x)
{
	while((int)d[x].size() > k)
		d[x].pop_front();
}
void update(int x, int y)
{
	rem(x);
	for(int l = last[y] + 1; l < d[x].front(); l++)
		if(s[l] == c[y]) d[y].push_back(l);
	last[y] = d[x].front() - 1;
}
void add_letter(int x)
{
	int l;
	for(l = 0; l < 2; l++)
	{
		if((int)d[l].size() < k)
		{
			if(s[x] == c[l])
			{
				d[l].push_back(x);
				last[l] = x;
			}
			if(d[l].size() == 1)
			{
				while(l)
				{
					update(l,l-1);
					l--;
				}
				rem(0);
			}
			return;
		}
	}
	if(s[x] != c[2]) return;
	d[2].push_back(x);
	last[2] = x;
	update(2,1);
	update(1,0);
	rem(0);
}
int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n, l, ans = -1;
	cin>>n>>k>>s;
	for(l = 0; l < n; l++)
	{
		add_letter(l);
		if((int)d[2].size() == k)
		{
			int cans = d[2].back() - d[0].front() + 1 - k * 3;
			if(ans == -1 || ans > cans) ans = cans;
		}
	}
	cout<<ans<<'\n';
}

Subtask #1
1.0 / 1.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
87.0 / 87.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 0 ms 384 KB Output is correct
23 Correct 0 ms 384 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 0 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 8 ms 896 KB Output is correct
37 Correct 10 ms 908 KB Output is correct
38 Correct 9 ms 908 KB Output is correct
39 Correct 8 ms 908 KB Output is correct
40 Correct 5 ms 908 KB Output is correct
41 Correct 8 ms 908 KB Output is correct
42 Correct 9 ms 908 KB Output is correct
43 Correct 3 ms 768 KB Output is correct
44 Correct 3 ms 908 KB Output is correct
45 Correct 7 ms 1036 KB Output is correct
46 Correct 4 ms 1036 KB Output is correct
47 Correct 6 ms 1036 KB Output is correct
48 Correct 4 ms 1036 KB Output is correct
49 Correct 4 ms 896 KB Output is correct
50 Correct 4 ms 1036 KB Output is correct
51 Correct 4 ms 1036 KB Output is correct
52 Correct 6 ms 1036 KB Output is correct
53 Correct 4 ms 1036 KB Output is correct
54 Correct 6 ms 1036 KB Output is correct
55 Correct 5 ms 1292 KB Output is correct
56 Correct 6 ms 1548 KB Output is correct