제출 #675346

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
675346		sudheerays123	JJOOII 2 (JOI20_ho_t2)	C++17	100 / 100	124 ms	44548 KiB

ho_t2

#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long int
const ll N = 100+5 , INF = 1e18 , MOD = 1e9+7;

void solve(){

	ll n,k;
	string s;

	cin >> n >> k >> s;
	s = ' '+s;

	vector<ll> nearj(n+5) , nearo(n+5),neari(n+5);
	ll lastj = 0 , lasto = 0 , lasti = 0;

	for(ll i = 1; i <= n; i++){

		nearj[i] = lastj;
		nearo[i] = lasto;
		neari[i] = lasti;

		if(s[i] == 'J') lastj = i;
		else if(s[i] == 'O') lasto = i;
		else lasti = i;
	}

	vector<vector<ll>> par(n+5,vector<ll>(log2(k)+5));

	for(ll i = 1; i <= n; i++){
		if(s[i] == 'J') par[i][0] = nearj[i];
		else if(s[i] == 'O') par[i][0] = nearo[i];
		else par[i][0] = neari[i];
	}

	for(ll j = 1; j <= log2(k); j++){
		for(ll i = 1; i <= n; i++){
			par[i][j] = par[par[i][j-1]][j-1];
		}
	}
	
	ll ans = INF;
	ll jump = k-1;

	for(ll i = 1; i <= n; i++){
		if(s[i] == 'I'){

			ll x = i;

			for(ll j = 0; j <= log2(k); j++){
				if(jump&(1ll<<j)){
					x = par[x][j];
				}
			}
			
			x = nearo[x];
			for(ll j = 0; j <= log2(k); j++){
				if(jump&(1ll<<j)){
					x = par[x][j];
				}
			}

			x = nearj[x];
			for(ll j = 0; j <= log2(k); j++){
				if(jump&(1ll<<j)){
					x = par[x][j];
				}
			}

			if(x > 0) ans = min(ans,(i-x+1)-(3*k));
		}
	}

	if(ans == INF) ans = -1;
	cout << ans;
}

int main(){

	fast;

	ll tc = 1;
	// cin >> tc;
	while(tc--) solve();

	return 0;
}

• Subtask 1: 1 / 1
• Subtask 2: 12 / 12
• Subtask 3: 87 / 87