oj.uz

답안 #244885

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
244885 2020-07-05T08:31:07 Z maximath_1 JJOOII 2 (JOI20_ho_t2) C++11
100 / 100
 47 ms 2960 KB 
#include <bits/stdc++.h>
using namespace std;

int n, k; string s;
int pref[200005][3];

int main(){
	cin >> n >> k;
	cin >> s;

	for(int i = 0; i < n; i ++){
		if(i > 0)
			for(int j = 0; j < 3; j ++)
				pref[i][j] = pref[i-1][j];
		if(s[i] == 'J') pref[i][0] ++;
		if(s[i] == 'O') pref[i][1] ++;
		if(s[i] == 'I') pref[i][2] ++;
	}

	int ans = 2e9;
	for(int i = 0; i < n; i ++){
		int cr = i;
		int lf = cr, rg = n, md;
		for(; lf < rg;){
			md = (lf + rg) / 2;
			if(pref[md][0] - (cr > 0 ? pref[cr - 1][0] : 0) >= k) rg = md;
			else lf = md + 1;
		}
		cr = lf;
		lf = cr, rg = n, md;
		for(; lf < rg;){
			md = (lf + rg) / 2;
			if(pref[md][1] - (cr > 0 ? pref[cr - 1][1] : 0) >= k) rg = md;
			else lf = md + 1;
		}
		cr = lf;
		lf = cr, rg = n, md;
		for(; lf < rg;){
			md = (lf + rg) / 2;
			if(pref[md][2] - (cr > 0 ? pref[cr - 1][2] : 0) >= k) rg = md;
			else lf = md + 1;
		}
		cr = lf;
		if(cr == n) continue;
		ans = min(ans, cr - i + 1 - 3 * k);
	}

	if(ans > n) ans = -1;
	printf("%d\n", ans);
	return 0;
}

Compilation message

ho_t2.cpp: In function 'int main()':
ho_t2.cpp:30:22: warning: right operand of comma operator has no effect [-Wunused-value]
   lf = cr, rg = n, md;
                      ^
ho_t2.cpp:37:22: warning: right operand of comma operator has no effect [-Wunused-value]
   lf = cr, rg = n, md;
                      ^

Subtask #1
1.0 / 1.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
87.0 / 87.0

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