oj.uz

Submission #244868

# Submission time Handle Problem Language Result Execution time Memory
244868 2020-07-05T07:54:23 Z vioalbert JJOOII 2 (JOI20_ho_t2) C++14
100 / 100
 17 ms 2768 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int N = 2e5+5;
int n, k;
int prefJ[N], prefO[N], prefI[N];

void read() {
	cin >> n >> k;
	prefJ[0] = prefO[0] = prefI[0] = 0;
	for(int i = 1; i <= n; i++) {
		char c; cin >> c;
		prefJ[i] = prefJ[i-1] + (c == 'J');
		prefO[i] = prefO[i-1] + (c == 'O');
		prefI[i] = prefI[i-1] + (c == 'I');
	}
}

int binserO(int l, int r) {
	int d = l-1;
	while(l < r) {
		int mid = (l+r)/2;
		if(prefO[mid] - prefO[d] < k) l = mid+1;
		else r = mid;
	}
	return l;
}

int binserI(int l, int r) {
	int d = l-1;
	while(l < r) {
		int mid = (l+r)/2;
		if(prefI[mid] - prefI[d] < k) l = mid+1;
		else r = mid;
	}
	return l;
}

void solve() {
	int ans = 1e9;
	int fp = 0, prv = 0;
	for(int i = 1; i <= n; i++) {
		if(prv < prefJ[i] && prefJ[i] >= k) {
			while(prefJ[fp] <= prefJ[i] - k) fp++;
			int mp = binserO(i+1, n+1);
			if(mp == n+1) break;
			int lp = binserI(mp+1, n+1);
			if(lp == n+1) break;
			ans = min(ans, lp - fp + 1 - 3*k);
		}
		prv = prefJ[i];
	}
	cout << ((ans==1e9)?(-1):ans) << '\n';
}

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	read(); solve();
	return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 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

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 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 4 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Correct 4 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 4 ms 384 KB Output is correct
33 Correct 5 ms 512 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

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 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 4 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Correct 4 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 4 ms 384 KB Output is correct
33 Correct 5 ms 512 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 2560 KB Output is correct
37 Correct 16 ms 2768 KB Output is correct
38 Correct 15 ms 2688 KB Output is correct
39 Correct 16 ms 2688 KB Output is correct
40 Correct 11 ms 2688 KB Output is correct
41 Correct 15 ms 2688 KB Output is correct
42 Correct 17 ms 2688 KB Output is correct
43 Correct 7 ms 1792 KB Output is correct
44 Correct 8 ms 2176 KB Output is correct
45 Correct 9 ms 2688 KB Output is correct
46 Correct 9 ms 2688 KB Output is correct
47 Correct 9 ms 2688 KB Output is correct
48 Correct 9 ms 2688 KB Output is correct
49 Correct 7 ms 1920 KB Output is correct
50 Correct 9 ms 2688 KB Output is correct
51 Correct 9 ms 2688 KB Output is correct
52 Correct 10 ms 2560 KB Output is correct
53 Correct 9 ms 2688 KB Output is correct
54 Correct 15 ms 2688 KB Output is correct
55 Correct 11 ms 2688 KB Output is correct
56 Correct 9 ms 2688 KB Output is correct