# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
208090 | w4123 | JJOOII 2 (JOI20_ho_t2) | C++17 | 24 ms | 1792 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 <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<int> v[3];
for (int i = 0; i != n; i++)
{
if (s[i] == 'J')
{
v[0].push_back(i);
}
else if (s[i] == 'O')
{
v[1].push_back(i);
}
else
{
v[2].push_back(i);
}
}
int res = 999999999;
for (int i = 0; i != v[0].size(); i++)
{
if (i + k - 1 >= v[0].size())break;
auto p = lower_bound(v[1].begin(), v[1].end(), v[0][i + k - 1]) - v[1].begin();
if (p + k - 1 >= v[1].size())break;
auto q = lower_bound(v[2].begin(), v[2].end(), v[1][p + k - 1]) - v[2].begin();
if (q + k - 1 >= v[2].size())break;
int ans = v[2][q + k - 1] - v[0][i] + 1 - 3 * k;
res = min(res, ans);
}
cout << (res == 999999999 ? -1 : res);
}
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... |