oj.uz

Submission #520918

# Submission time Handle Problem Language Result Execution time Memory
520918 2022-01-31T13:12:24 Z AdamGS JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 9 ms 3160 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=2e5+7;
int nxt[LIM][3];
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n, k;
	string s;
	cin >> n >> k >> s;
	int a=0, b=0, c=0;
	for(auto i : s) {
		if(a<k) {
			if(i=='J') ++a;
		} else if(b<k) {
			if(i=='O') ++b;
		} else {
			if(i=='I') ++c;
		}
	}
	if(c<k) {
		cout << -1 << '\n';
		return 0;
	}
	string x="JOI";
	rep(i, 3) {
		int l=-1, ile=0;
		rep(j, n) {
			while(l<n-1 && ile<k) {
				++l;
				if(s[l]==x[i]) ++ile;
			}
			if(ile==k) nxt[j][i]=l;
			else nxt[j][i]=-1;
			if(s[j]==x[i]) --ile;
		}
	}
	int ans=n;
	rep(i, n) {
		int a=nxt[i][0];
		if(a!=-1 && a<n-1) {
			a=nxt[a+1][1];
			if(a!=-1 && a<n-1) {
				a=nxt[a+1][2];
				if(a!=-1) {
					ans=min(ans, a-i+1-3*k);
				}
			}
		}
	}
	cout << ans << '\n';
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 0 ms 320 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 320 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 300 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 324 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 320 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 1 ms 320 KB Output is correct
3 Correct 0 ms 320 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 320 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 300 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 324 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 320 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 308 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 1 ms 320 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 320 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 320 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 320 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 1 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 1 ms 320 KB Output is correct
3 Correct 0 ms 320 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 320 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 300 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 324 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 320 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 308 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 1 ms 320 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 320 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 320 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 320 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 6 ms 2916 KB Output is correct
37 Correct 7 ms 3160 KB Output is correct
38 Correct 6 ms 3160 KB Output is correct
39 Correct 9 ms 3160 KB Output is correct
40 Correct 7 ms 3160 KB Output is correct
41 Correct 8 ms 3160 KB Output is correct
42 Correct 8 ms 3160 KB Output is correct
43 Correct 4 ms 2120 KB Output is correct
44 Correct 6 ms 2520 KB Output is correct
45 Correct 6 ms 3160 KB Output is correct
46 Correct 7 ms 3132 KB Output is correct
47 Correct 7 ms 3160 KB Output is correct
48 Correct 7 ms 3152 KB Output is correct
49 Correct 1 ms 716 KB Output is correct
50 Correct 1 ms 840 KB Output is correct
51 Correct 1 ms 812 KB Output is correct
52 Correct 1 ms 844 KB Output is correct
53 Correct 1 ms 872 KB Output is correct
54 Correct 4 ms 3144 KB Output is correct
55 Correct 4 ms 3160 KB Output is correct
56 Correct 4 ms 3144 KB Output is correct