oj.uz

답안 #234088

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
234088 2020-05-23T00:14:04 Z eggag32 JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 22 ms 3212 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) for(int i = 0; i < (int)(a); i++)
#define all(v) v.begin(), v.end() 
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define sq(x) ((x) * (x))

template<class T> T gcd(T a, T b){ return ((b == 0) ? a : gcd(b, a % b)); }

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	//freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
	int n, k;
	cin >> n >> k;
	string s;
	cin >> s;
	int ans = 1e9;
	vi cntJ(n, 0), cntO(n, 0), cntI(n, 0);
	cntJ[0] = (s[0] == 'J');
	repn(i, 1, n) cntJ[i] = cntJ[i - 1] + (s[i] == 'J');
	cntO[0] = (s[0] == 'O');
	repn(i, 1, n) cntO[i] = cntO[i - 1] + (s[i] == 'O');
	cntI[0] = (s[0] == 'I');
	repn(i, 1, n) cntI[i] = cntI[i - 1] + (s[i] == 'I');
	rep(i, n - (3 * k) + 1) if(s[i] == 'J'){
		int l = i, r = n - 1;
		int num = 0;
		if(i) num = cntJ[i - 1];
		while(l < r){
			int mid = (l + r) / 2;
			if((cntJ[mid] - num) >= k) r = mid;
			else l = mid + 1;
		}
		if((cntJ[l] - num) < k) continue;
		int cur = (l - i + 1) - k;
		num = cntO[l];
		int l1 = l + 1, r1 = n - 1;
		while(l1 < r1){
			int mid = (l1 + r1) / 2;
			if((cntO[mid] - num) >= k) r1 = mid;
			else l1 = mid + 1;
		}
		if((cntO[l1] - num) < k) continue;
		cur += (l1 - l) - k;
		num = cntI[l1];
		int l2 = l1 + 1, r2 = n - 1;
		while(l2 < r2){
			int mid = (l2 + r2) / 2;
			if((cntI[mid] - num) >= k) r2 = mid;
			else l2 = mid + 1;
		}
		if((cntI[l2] - num) < k) continue;
		cur += (l2 - l1) - k;
		ans = min(ans, cur);
	}
	if(ans == 1e9) ans = -1;
	cout << ans << endl;
	return 0;
}
/*
Things to look out for:
	- Integer overflows
	- Array bounds
	- Special cases
Be careful!
*/

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 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 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 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 384 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 384 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 4 ms 384 KB Output is correct

Subtask #3
87.0 / 87.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 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 384 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 384 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 4 ms 384 KB Output is correct
36 Correct 15 ms 3084 KB Output is correct
37 Correct 15 ms 3212 KB Output is correct
38 Correct 16 ms 3212 KB Output is correct
39 Correct 21 ms 3212 KB Output is correct
40 Correct 17 ms 3212 KB Output is correct
41 Correct 19 ms 3212 KB Output is correct
42 Correct 22 ms 3212 KB Output is correct
43 Correct 12 ms 2176 KB Output is correct
44 Correct 13 ms 2572 KB Output is correct
45 Correct 15 ms 3212 KB Output is correct
46 Correct 14 ms 3212 KB Output is correct
47 Correct 14 ms 3212 KB Output is correct
48 Correct 15 ms 3212 KB Output is correct
49 Correct 11 ms 2316 KB Output is correct
50 Correct 15 ms 3212 KB Output is correct
51 Correct 19 ms 3212 KB Output is correct
52 Correct 9 ms 3084 KB Output is correct
53 Correct 8 ms 3212 KB Output is correct
54 Correct 21 ms 3212 KB Output is correct
55 Correct 12 ms 3212 KB Output is correct
56 Correct 7 ms 3212 KB Output is correct