| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 717232 | vjudge1 | JJOOII 2 (JOI20_ho_t2) | C++17 | 1 ms | 844 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 n,k,ans = INT_MAX;
string s;
vector<int> a,b,c;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n >> k >> s;
if(n>3000) return 0;
for(int i = 0;i < n;i++)
{
char ch = s[i];
if(ch=='J') a.push_back(i);
else if(ch=='O') b.push_back(i);
else c.push_back(i);
}
for(int i = 0;i+k-1 < a.size();i++)
{
int x = a[i+k-1];
auto ib = upper_bound(b.begin(),b.end(),x);
if((int)(b.end()-ib)<k) break;
ib+=k-1;
x = *ib;
auto ic = upper_bound(c.begin(),c.end(),x);
if((int)(c.end()-ic)<k) break;
ic+=k-1;
ans = min(ans,*ic-a[i]+1-(k*3));
}
if(ans==INT_MAX) ans = -1;
cout << ans;
}
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... | ||||
