# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
520634 | aris12345678 | JJOOII 2 (JOI20_ho_t2) | C++14 | 13 ms | 2004 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;
vector<int> a, b, c;
for(int i = 0; i < n; i++) {
if(s[i] == 'J')
a.push_back(i);
else if(s[i] == 'O')
b.push_back(i);
else
c.push_back(i);
}
int ans = INT_MAX;
for(int i = k-1; i < (int)a.size(); i++) {
// cout << a[i] << "\n";
int j = upper_bound(b.begin(), b.end(), a[i])-b.begin();
// cout << b[j] << "\n";
if(j+k-1 >= (int)b.size()) break;
int u = upper_bound(c.begin(), c.end(), b[j+k-1])-c.begin();
if(u+k-1 >= (int)c.size()) break;
// cout << a[i-k+1] << " " << c[u+k-1] << "\n";
ans = min(ans, (c[u+k-1]-a[i-k+1]+1)-3*k);
}
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... |