Submission #582506

# Submission time Handle Problem Language Result Execution time Memory
582506 2022-06-24T01:19:33 Z teki JJOOII 2 (JOI20_ho_t2) C++11
100 / 100
30 ms 3296 KB
#include <bits/stdc++.h>
 
using namespace std;
 
int main()
{
	#if LOCAL_DEBUG
		fstream cin("in.txt");
	#endif
 
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
 
	int n,k;
	cin>>n>>k;
 
	int pref[3][n+5];
	memset(pref,0,sizeof(pref));
 
	/// J pa O pa I
 
	string s;
	cin>>s;
	
	// konstruirame tabela na prefiks suma, samo go koristime brojot od prethodnata pozicija i dodavame 1 ako go ima karakterot sto go razgleduvame
	// vo ovaa implementacija, koristam vestacki prazna 0-ta pozicija za da mi bide polesno se
 
	for (int i = 0; i<n; i++) {
		pref[0][i+1] = pref[0][i] + (s[i] == 'J');
		pref[1][i+1] = pref[1][i] + (s[i] == 'O');
		pref[2][i+1] = pref[2][i] + (s[i] == 'I');
	}
 
	int curr[3];
	int res = INT_MAX/2;
 
	for (int i = 0; i<=n; i++) {
		for (int j = 0; j<3; j++) curr[j] = pref[j][i]; // go cuvame posledniot broj na karakteri od sekoj tip postojano za da moze da sporedime
 
		int newPos = i;
		int resC = 0;
 
		for (int j = 0; j<3; j++) {
			auto itJ = lower_bound(pref[j]+newPos,pref[j]+(n+1),curr[j]+k); // najdi ja slednata pozicija so +k karakteri od ovoj tip
 
			if (itJ == pref[j]+(n+1)) {resC = INT_MAX/2; break; } // ako nema, break, bidejkji nema rezultat za ovaa fiks. pozicija
 
			newPos = itJ-pref[j]; // pomesti se na slednata pozicija
 
			for (int k = 0; k<3; k++) if (k != j) resC += pref[k][newPos]-curr[k]; // dodaj ja razlikata na rezultatot
			for (int k = 0; k<3; k++) curr[k] = pref[k][newPos];
		}
 
		res = min(res,resC); // go apdejtirame konecniot rezultat
	}
 
	if (res != INT_MAX/2) cout<<res<<endl;
	else cout<<-1<<endl;
 
	return 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 324 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 320 KB Output is correct
# 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 324 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 320 KB Output is correct
15 Correct 1 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 1 ms 316 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 320 KB Output is correct
22 Correct 1 ms 320 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 316 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 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 244 KB Output is correct
35 Correct 1 ms 324 KB Output is correct
# 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 324 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 320 KB Output is correct
15 Correct 1 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 1 ms 316 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 320 KB Output is correct
22 Correct 1 ms 320 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 316 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 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 244 KB Output is correct
35 Correct 1 ms 324 KB Output is correct
36 Correct 19 ms 3028 KB Output is correct
37 Correct 25 ms 3188 KB Output is correct
38 Correct 30 ms 3168 KB Output is correct
39 Correct 27 ms 3160 KB Output is correct
40 Correct 18 ms 3160 KB Output is correct
41 Correct 26 ms 3212 KB Output is correct
42 Correct 27 ms 3168 KB Output is correct
43 Correct 9 ms 2132 KB Output is correct
44 Correct 11 ms 2644 KB Output is correct
45 Correct 15 ms 3168 KB Output is correct
46 Correct 15 ms 3296 KB Output is correct
47 Correct 15 ms 3168 KB Output is correct
48 Correct 15 ms 3168 KB Output is correct
49 Correct 10 ms 2272 KB Output is correct
50 Correct 14 ms 3160 KB Output is correct
51 Correct 14 ms 3168 KB Output is correct
52 Correct 7 ms 3080 KB Output is correct
53 Correct 8 ms 3200 KB Output is correct
54 Correct 13 ms 3156 KB Output is correct
55 Correct 9 ms 3168 KB Output is correct
56 Correct 8 ms 3168 KB Output is correct