oj.uz

Submission #292341

# Submission time Handle Problem Language Result Execution time Memory
292341 2020-09-06T20:48:25 Z matheo_apd JJOOII 2 (JOI20_ho_t2) C++17
100 / 100
 19 ms 3244 KB 
#include <bits/stdc++.h>
using namespace std;
#define maxn 200005
#define j 0
#define o 1
#define i 2 //cuidado com os nomekkkkkk
int pref[3][maxn];
int n, k, minimo = maxn, pj = 1, po = 1, pi = 1, p0 = 1;
string s; //vou testar se o tamanho da string aguenta maxn caras

void joi(){
	while(pref[j][po-1] - pref[j][pj-1] < k){
		po++;
		if(po > n) return;
	}
	while(pref[o][pi-1] - pref[o][po-1] < k){
		pi++;
		if(pi > n) return;
	}
	while(pref[i][p0-1] - pref[i][pi-1] < k){
		p0++;
		if(p0 > n+1) return;
	}
}

int solve(){
	for(pj = 1; pj < n; pj++){

		joi();
		if(p0 > n+1 or pi > n or po > n) break;
		minimo = min(minimo, p0 - pj - 3*k);
	}
	if(minimo == maxn) return -1;
	return minimo;
}

int main(){
	cin >> n >> k >> s;
	s = " " + s;
	for(int cont = 1; cont <= n; cont++){

		for(int letter = j; letter <= i; letter++)
			pref[letter][cont] = pref[letter][cont-1];

		if(s[cont] == 'J')
			pref[j][cont]++;
		if(s[cont] == 'O')
			pref[o][cont]++;
		if(s[cont] == 'I')
			pref[i][cont]++; 
	}
	cout << solve() << endl;
	return 0;
}

Subtask #1
1.0 / 1.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
87.0 / 87.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 16 ms 3032 KB Output is correct
37 Correct 19 ms 3144 KB Output is correct
38 Correct 17 ms 3148 KB Output is correct
39 Correct 19 ms 3148 KB Output is correct
40 Correct 14 ms 3148 KB Output is correct
41 Correct 16 ms 3148 KB Output is correct
42 Correct 19 ms 3148 KB Output is correct
43 Correct 8 ms 2068 KB Output is correct
44 Correct 11 ms 2552 KB Output is correct
45 Correct 14 ms 3148 KB Output is correct
46 Correct 13 ms 3244 KB Output is correct
47 Correct 14 ms 3244 KB Output is correct
48 Correct 13 ms 3148 KB Output is correct
49 Correct 9 ms 2188 KB Output is correct
50 Correct 14 ms 3148 KB Output is correct
51 Correct 13 ms 3148 KB Output is correct
52 Correct 13 ms 3036 KB Output is correct
53 Correct 13 ms 3148 KB Output is correct
54 Correct 13 ms 3148 KB Output is correct
55 Correct 13 ms 3148 KB Output is correct
56 Correct 14 ms 3148 KB Output is correct