제출 #203216

#제출 시각아이디문제언어결과실행 시간메모리
203216staniewzkiJJOOII 2 (JOI20_ho_t2)C++14
100 / 100
10 ms1916 KiB
#include<bits/stdc++.h>
using namespace std;
 
ostream& operator<<(ostream &out, string str) {
	for(char c : str) out << c;
	return out;
}
 
template<class L, class R> ostream& operator<<(ostream &out, pair<L, R> p) {
	return out << "(" << p.first << ", " << p.second << ")";
}
 
template<class T> auto operator<<(ostream &out, T a) -> decltype(a.begin(), out) {
	out << "{";
	for(auto it = a.begin(); it != a.end(); it = next(it))
		out << (it != a.begin() ? ", " : "") << *it;
	return out << "}";
}
 
void dump() { cerr << "\n"; }
template<class T, class... Ts> void dump(T a, Ts... x) {
	cerr << a << ", ";
	dump(x...);
}
 
#ifdef DEBUG
#  define debug(...) cerr << "[" #__VA_ARGS__ "]: ", dump(__VA_ARGS__)
#else
#  define debug(...) false
#endif
 
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, a, b) for(int i = a; i <= b; i++)
#define ST first
#define ND second
 
template<class T> int size(T && a) { return a.size(); }
 
using LL = long long;
using PII = pair<int, int>;

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

	int n, k;
	string str;
	cin >> n >> k >> str;

	vector<int> a, b, c;
	int A = -1e9, B = -1e9, ans = 1e9;

	REP(i, n) {
		if(str[i] == 'J') {
			a.emplace_back(i);
			if(size(a) >= k)
				A = a[size(a) - k];
		}
		else if(str[i] == 'O') {
			b.emplace_back(A);
			if(size(b) >= k)
				B = b[size(b) - k];
		}
		else if(str[i] == 'I') {
			c.emplace_back(B);
			if(size(c) >= k) {
				int C = c[size(c) - k];
				ans = min(ans, i - C + 1 - 3 * k);
			}
		}
	}

	if(ans > n) ans = -1;
	cout << ans << "\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...