# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1200038 | Warinchai | JJOOII 2 (JOI20_ho_t2) | C11 | 0 ms | 0 KiB |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n,k;cin>>n>>k;
string s;cin>>s;
vector<int>J,O,I;
int ans=INT_MAX;
for(int i=0;i<s.size();i++){
char x=s[i];
if(x=='J')J.push_back(i);
else if(x=='O')O.push_back(i);
else I.push_back(i);
if(I.size()<k)continue;
int en=I.back();
int ten=I.size()-2;
ten=I[ten];
ten=lower_bound(O.begin(),O.end(),ten)-O.begin()-k;
if(ten<0)continue;
ten=O[ten];
ten=lower_bound(J.begin(),J.end(),ten)-J.begin()-k;
if(ten<0)continue;
ten=J[ten];
ans=min(ans,en-ten+1-(k*3));
}
if(ans==INT_MAX)cout<<-1;
else cout<<ans;
}