oj.uz

Submission #676986

# Submission time Handle Problem Language Result Execution time Memory
676986 2023-01-02T02:54:28 Z penguin133 JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 9 ms 3284 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif

int n, k;
char A[200005];

vector<int> v1, v2, v3;
int in, in3;

void solve(){
	cin >> n >> k;
	for(int i=1;i<=n;i++){
		cin >> A[i];
		if(A[i] == 'J')v1.push_back(i);
		else if(A[i] == 'O')v2.push_back(i);
		else v3.push_back(i);
	}
	if((int)v1.size() < k || (int)v2.size() < k || (int)v3.size() < k){
		cout << -1;
		return;
	}
	int mn = 1e9;
	for(int i=k-1;i<(int)v2.size();i++){
		int fst = v2[i-k+1], lst = v2[i];
		int cur = (lst - fst + 1) - k;
		while(in < (int)v1.size() && v1[in] < fst)in++;
		cur += (in > k - 1 ? (fst - v1[in-k]) - k : 1e9);
		while(in3 < (int)v3.size() && v3[in3] < lst)in3++;
		cur += (in3 + k - 1 < (int)v3.size() ? (v3[in3 + k - 1] - lst) - k : 1e9);
		mn = min(mn, cur);
	}
	cout << (mn == (int)1e9 ? -1 : mn);
}

main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	//cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

Compilation message

ho_t2.cpp:44:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   44 | main(){
      | ^~~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 324 KB Output is correct
14 Correct 1 ms 324 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 324 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 328 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 328 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 352 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct

Subtask #3
87.0 / 87.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 324 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 328 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 328 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 352 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 7 ms 2244 KB Output is correct
37 Correct 8 ms 2888 KB Output is correct
38 Correct 8 ms 2852 KB Output is correct
39 Correct 8 ms 2872 KB Output is correct
40 Correct 8 ms 2908 KB Output is correct
41 Correct 8 ms 3016 KB Output is correct
42 Correct 8 ms 2884 KB Output is correct
43 Correct 4 ms 1868 KB Output is correct
44 Correct 6 ms 1984 KB Output is correct
45 Correct 9 ms 2888 KB Output is correct
46 Correct 8 ms 2824 KB Output is correct
47 Correct 8 ms 2932 KB Output is correct
48 Correct 8 ms 2888 KB Output is correct
49 Correct 5 ms 1744 KB Output is correct
50 Correct 7 ms 2888 KB Output is correct
51 Correct 8 ms 2884 KB Output is correct
52 Correct 6 ms 2248 KB Output is correct
53 Correct 7 ms 3144 KB Output is correct
54 Correct 5 ms 3284 KB Output is correct
55 Correct 5 ms 3284 KB Output is correct
56 Correct 5 ms 3284 KB Output is correct