oj.uz

Submission #508734

# Submission time Handle Problem Language Result Execution time Memory
508734 2022-01-13T16:48:41 Z thiago_bastos JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 17 ms 2004 KB 
#include "bits/stdc++.h"

using namespace std;

using i64 = long long;
using u64 = unsigned long long;
using i32 = int;
using u32 = unsigned;
using i16 = short;
using u16 = unsigned short;
using ld = long double;
using ii = pair<int, int>;

const int inf = 1e9;

void solve() {	
	int n, k, ans = inf;
	string s;

	cin >> n >> k >> s;

	vector<int> p[3];
	
	for(int i = 0; i < n; ++i) {
		if(s[i] == 'J') p[0].push_back(i);
		else if(s[i] == 'O') p[1].push_back(i);
		else p[2].push_back(i);
	}

	for(int i = 0; i < n; ++i) {
		if(s[i] != 'J') continue;
		int last = i;
		bool ok = true;
		for(int j = 0; j < 3; ++j) {
			int l = lower_bound(p[j].begin(), p[j].end(), last) - p[j].begin();
			if(l + k > (int)p[j].size()) {
				ok = false;
				break;
			}
			last = p[j][l + k - 1];
		}
		if(!ok) continue;
		ans = min(ans, last - i + 1 - 3 * k);
	}

	if(ans == inf) cout << "-1\n";
	else cout << ans << '\n';
}

int main() {
	ios_base :: sync_with_stdio(false);
	cin.tie(0);
	int t = 1;
	//cin >> t;
	while(t--) solve();
	return 0;
}

Subtask #1
1.0 / 1.0

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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 304 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 292 KB Output is correct
6 Correct 0 ms 308 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 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 332 KB Output is correct
16 Correct 1 ms 300 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 1 ms 312 KB Output is correct
22 Correct 1 ms 308 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 312 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 0 ms 312 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 0 ms 332 KB Output is correct

Subtask #3
87.0 / 87.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 304 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 292 KB Output is correct
6 Correct 0 ms 308 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 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 332 KB Output is correct
16 Correct 1 ms 300 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 1 ms 312 KB Output is correct
22 Correct 1 ms 308 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 312 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 0 ms 312 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 13 ms 1592 KB Output is correct
37 Correct 17 ms 1820 KB Output is correct
38 Correct 14 ms 1940 KB Output is correct
39 Correct 15 ms 1968 KB Output is correct
40 Correct 12 ms 2000 KB Output is correct
41 Correct 15 ms 1940 KB Output is correct
42 Correct 15 ms 1892 KB Output is correct
43 Correct 8 ms 1260 KB Output is correct
44 Correct 9 ms 1456 KB Output is correct
45 Correct 12 ms 2004 KB Output is correct
46 Correct 12 ms 1948 KB Output is correct
47 Correct 12 ms 1988 KB Output is correct
48 Correct 12 ms 1984 KB Output is correct
49 Correct 8 ms 1296 KB Output is correct
50 Correct 12 ms 1976 KB Output is correct
51 Correct 12 ms 1964 KB Output is correct
52 Correct 8 ms 1476 KB Output is correct
53 Correct 10 ms 1688 KB Output is correct
54 Correct 7 ms 1988 KB Output is correct
55 Correct 7 ms 1960 KB Output is correct
56 Correct 6 ms 2004 KB Output is correct