제출 #1280886

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1280886		SSKMF	JJOOII 2 (JOI20_ho_t2)	C++20	100 / 100	6 ms	2460 KiB

ho_t2

#include <bits/stdc++.h>
using namespace std;

int minim[2][300001];
char sir[300001];

int main ()
{
    ios :: sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);

    int lungime , cantitate;
    cin >> lungime >> cantitate >> sir;

    for (auto dorit : {'J' , 'O' , 'I'})
    {
        queue <int> gasit;
        for (int indice = 0 ; indice <= lungime ; indice++)
        {
            if (sir[indice - 1] == dorit)
                { gasit.push(indice); }

            if ((int)gasit.size() > cantitate)
                { gasit.pop(); }

            if ((int)gasit.size() < cantitate || minim[0][gasit.front() - 1] == -1)
                { minim[1][indice] = -1; continue; }

            minim[1][indice] = minim[0][gasit.front() - 1] + indice - gasit.front() + 1;
        }

        for (int indice = 0 ; indice <= lungime ; indice++)
            { minim[0][indice] = minim[1][indice]; }
    }

    if (minim[1][lungime] == -1)
        { cout << "-1"; return 0; }
    
    int rezultat = INT32_MAX;
    for (int indice = 0 ; indice <= lungime ; indice++) {
        if (minim[1][indice] != -1)
            { rezultat = min(rezultat , minim[1][indice]); }
    }

    cout << rezultat - 3 * cantitate;
    return 0;
}

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