# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
520385 | aris12345678 | JJOOII 2 (JOI20_ho_t2) | C++14 | 2053 ms | 808 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
scanf("%d %d", &n, &k);
string s;
cin >> s;
int ans = INT_MAX;
for(int i = 0; i < n; i++) {
if(s[i] != 'J') continue;
string t = "";
int m = 0;
for(int j = i; j < n; j++) {
if(m < k && s[j] == 'J')
t += s[j], m++;
if(m >= k && m < 2*k && s[j] == 'O')
t += s[j], m++;
if(m >= 2*k && m < 3*k && s[j] == 'I')
t += s[j], m++;
if(m == 3*k) {
ans = min(ans, (j-i+1)-m);
// cout << i << " " << j << ": " << t << "\n";
}
}
}
if(ans == INT_MAX)
printf("-1\n");
else
printf("%d\n", ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |