제출 #1133288

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1133288		MunkhturErdenebat	JJOOII 2 (JOI20_ho_t2)	C++20	100 / 100	12 ms	3020 KiB

ho_t2

#include<bits/stdc++.h>
#include<string.h>
#include <algorithm>
#include <stdlib.h>
 #define ll long long
using namespace std;
    ll k[5][100000],a,b,c,d,e,f,m,i,j,n,h,g,l,r,ka,p,q,t[200005];
    map<ll,ll> maa,mii,mee;
    vector<ll> vj,vo,vi;
    string x,y,z;

int main(){
    cin>>a>>b;
    cin>>x;
    for(i=0 ; i<a ; i++){
        if(x[i]=='J'){
            vj.push_back(i);
        }
        if(x[i]=='O'){
            vo.push_back(i);
        }
        if(x[i]=='I'){
            vi.push_back(i);
        }
    }
    if(vj.size()<b){
        cout<<-1;
        return 0;
    }
    if(vo.size()<b){
        cout<<-1;
        return 0;
    }
    if(vi.size()<b){
        cout<<-1;
        return 0;
    }
    h=-1;
    for(i=0 ; i<vo.size()-b+1 ; i++){
        if(vo[i]>vj[b-1]){
            h=i;
            break;
        }
    }
    if(h==-1){
        cout<<h;
        return 0;
    }
    if(vo[h+b-1]>vi[vi.size()-b]){
        cout<<-1;
        return 0;
    }
    h=100000000000;
    for(i=0 ; i<vj.size()-b+1 ; i++){
        n=vj[i+b-1];
        l=0;
        r=vo.size()-b;
        if(vo[r]<n){
            break;
        }
        while(l<r){
            m=(l+r-1)/2;
            if(vo[m]>n){
                r=m;
            }
            else{
                l=m+1;
            }
        }
        n=vo[l+b-1];
        l=0;
        r=vi.size()-b;
        if(vi[r]<n){
            break;
        }
        while(l<r){
            m=(l+r-1)/2;
            if(vi[m]>n){
                r=m;
            }
            else{
                l=m+1;
            }
            
        }
        l+=b-1;
        h=min(h,(a-3*b-vj[i]-(a-vi[l]-1)));
    }
    cout<<h<<endl;
    
}

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