oj.uz

Submission #296349

# Submission time Handle Problem Language Result Execution time Memory
296349 2020-09-10T13:49:29 Z jbroeksteeg JJOOII 2 (JOI20_ho_t2) C++14
100 / 100
 11 ms 2064 KB 
#include <iostream>
#include <climits>
#include <numeric>
#include <cassert>
#include <algorithm>
#include <queue>
#include <map>
#include <stack>
#include <set>
#include <vector>
#include <array>
#include <memory>

#define IN(a,b) (a.find(b) != a.end())
#define p(a,b) make_pair(a,b)
#define readVec(a) for (int __i = 0; __i<(int)a.size();__i++){cin>>a[__i];}

// jimjam

template<typename T>
void pMin(T &a, T b) {if (b<a){a=b;}}
template<typename T>
void pMax(T &a, T b) {if (b>a){a=b;}}
template<typename T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& c);
template<typename A, typename B>
std::ostream& operator<<(std::ostream& os, const std::pair<A,B>& c) {std::cout << "(" << c.first << ", " << c.second << ")";return os;}
template<typename T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& c) {
	if (c.size() == 0) {os << "{}"; return os;}
	os << "{" << c[0];
	for (int i = 1; i < (int)c.size(); i++) {os <<", "<<c[i];}
	os << "}";
	return os;
}

using namespace std;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	int n, k; cin >> n >> k;
	string s; cin >> s;
	vector<int> posJ, posO, posI;
	for (int i = 0; i < n; i++) {
		if (s[i]=='J') {
			posJ.push_back(i);
		} else if (s[i]=='O') {
			posO.push_back(i);
		} else if (s[i]=='I') {
			posI.push_back(i);
		} else {
			assert(false);
		}
	}
	int ans = INT_MAX;
	for (int i = 0; i < ((int)posJ.size())-k+1; i++) {
		int startPos = posJ[i], endPos = posJ[i+k-1];
		int cnt = endPos-startPos-k+2-1;		
		int oStart = distance(posO.begin(), lower_bound(posO.begin(),posO.end(),endPos+1));
		if (oStart+k-1 < ((int)posO.size())) {
			cnt += posO[oStart]-endPos-1;
			int oEnd = posO[oStart+k-1];
			cnt += (oEnd - posO[oStart] -k+2-1);
			int iStart = distance(posI.begin(), lower_bound(posI.begin(),posI.end(), oEnd+1));
			cnt += posI[iStart]-oEnd-1;
			if (iStart+k-1 < (int)posI.size()) {
				int oEnd = posI[iStart+k-1];
				cnt += (oEnd - posI[iStart]-k+2-1);
				pMin(ans,cnt);
			}
		}
	}
	cout << (ans==INT_MAX?-1:ans) << endl;
	return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 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 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 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 416 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 0 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 1 ms 512 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 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 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 416 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 0 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 1 ms 512 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 10 ms 1540 KB Output is correct
37 Correct 11 ms 1864 KB Output is correct
38 Correct 11 ms 2064 KB Output is correct
39 Correct 10 ms 2052 KB Output is correct
40 Correct 8 ms 2020 KB Output is correct
41 Correct 10 ms 2036 KB Output is correct
42 Correct 11 ms 1924 KB Output is correct
43 Correct 5 ms 1376 KB Output is correct
44 Correct 6 ms 1524 KB Output is correct
45 Correct 8 ms 2052 KB Output is correct
46 Correct 8 ms 1920 KB Output is correct
47 Correct 7 ms 2052 KB Output is correct
48 Correct 7 ms 2052 KB Output is correct
49 Correct 5 ms 1292 KB Output is correct
50 Correct 8 ms 1924 KB Output is correct
51 Correct 7 ms 1940 KB Output is correct
52 Correct 4 ms 1608 KB Output is correct
53 Correct 5 ms 1864 KB Output is correct
54 Correct 6 ms 2052 KB Output is correct
55 Correct 4 ms 2052 KB Output is correct
56 Correct 3 ms 2052 KB Output is correct