# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1114670 | AdamGS | JJOOII 2 (JOI20_ho_t2) | C++17 | 12 ms | 2644 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |