#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
int main() {
    int n, k;
    cin >> n >> k;
    string s;
    cin >> s;
    int res = inf;
    vector<int> j, o, i;
    
    for (int x = 0; x < n; ++x) {
        char ch = s[x];
        if (ch == 'j') j.push_back(x);
        else if (ch == 'o') o.push_back(x);
        else i.push_back(x);
        if ((int)i.size() < k) continue;
        int p = i.back();
        int q = i[(int)i.size() - k];
        int r = lower_bound(o.begin(), o.end(), q) - o.begin() - k;
        if (r < 0) continue;
        q = o[r];
        r = lower_bound(j.begin(), j.end(), q) - j.begin() - k;
        if (r < 0) continue;
        q = j[r];
        res = min(res, p - q + 1 - 3 * k);
    }
    if(res==inf) cout<<"-1\n";
    else cout<<res<<endl;
    
    return 0;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |