Submission #1179563

#	Time	Username	Problem	Language	Result	Execution time	Memory
1179563		Szymon_Pilipczuk	JJOOII 2 (JOI20_ho_t2)	C++20	100 / 100	12 ms	2452 KiB

ho_t2

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n,k;
    cin>>n>>k;
    string s;
    cin>>s;
    vector<int> j;
    vector<int> l;
    for(int i = 0;i<n;i++)
    {
        if(s[i] == 'J')
        {
            j.push_back(i);
        }
        if(s[i] == 'O')
        {
            if(j.size() < k)
            {
                l.push_back(-1);
            }
            else
            {
                l.push_back(j[j.size() - k]);
            }
        }
    }
    vector<int> i;
    vector<int> r;
    for(int q = n-1;q>=0;q--)
    {
        if(s[q] == 'I')
        {
            i.push_back(q);
        }
        if(s[q] == 'O')
        {
            if(i.size()<k)
            {
                r.push_back(-1);
            }
            else
            {
                r.push_back(i[i.size()-k]);
            }
        }
    }
    reverse(r.begin(),r.end());
    int ans = -1;
    for(int q = 0;q<r.size()-k+1;q++)
    {
        if(l[q] == -1) continue;
        if(r[q+k-1] == -1) continue;
        ans = max(ans,l[q]+n-r[q+k-1]-1);
    }
    if(ans == -1) cout<<ans;
    else cout<<n-ans-k*3;
}

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