Submission #1341640

#TimeUsernameProblemLanguageResultExecution timeMemory
1341640blacktulipJJOOII 2 (JOI20_ho_t2)C++17
100 / 100
10 ms3016 KiB
//Hello!..
//dört böler altı artı iki ama ne böler altı ne böler iki
//Başarı, Boş Duranın Hakkı Değil... Koşturanın Hakkıdır. Hakan?
//Ne yapayım, elimden gelen bu :(
//S'il vous plait
#include <bits/stdc++.h>
using namespace std;

typedef long long lo; 

#define fi first
#define se second
#define endl "\n"
#define pb push_back
#define int long long
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define setrandom mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define getrandom(a,b) uniform_int_distribution<int>(a,b)(rng)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
#define _ << " " <<

const lo inf = 1000000000;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,a[li],k,flag,t;
int cev;
string s;
vector<int> v[4];

int32_t main(){
	fio();
	cin>>n>>k>>s;
	for(int i=0;i<n;i++){
		if(s[i]=='J')v[0].pb(i);
		if(s[i]=='O')v[1].pb(i);
		if(s[i]=='I')v[2].pb(i);
	}
	cev=inf;
	for(int i=0;i<(int)v[0].size()-k+1;i++){
		int at=v[0][i+k-1];
		at=lower_bound(v[1].begin(),v[1].end(),at)-v[1].begin();
		if(at+k-1>=(int)v[1].size()){break;}
		at=v[1][at+k-1];
		
		at=lower_bound(v[2].begin(),v[2].end(),at)-v[2].begin();
		if(at+k-1>=(int)v[2].size())break;
		//~ cerr<<at _ i<<endl;
		at=v[2][at+k-1];
		cev=min(cev,at-v[0][i]-k*3+1);
	}
	if(cev==inf)cev=-1;
	cout<<cev<<endl;
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...