# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
288764 | luciocf | JJOOII 2 (JOI20_ho_t2) | C++14 | 0 ms | 256 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;
const int maxn = 3e3+10;
const int inf = 1e9+10;
int n, k;
vector<int> pos[3];
int get_next(int ind, int p)
{
auto it = lower_bound(pos[ind].begin(), pos[ind].end(), p);
if (it == pos[ind].end()) return -1;
int x = (int)(it-pos[ind].begin());
if (x+k-1 >= pos[ind].size()) return -1;
return pos[ind][x+k-1];
}
int main(void)
{
string s;
cin >> n >> k >> s;
int ans = inf;
for (int i = 0; i < n; i++)
{
if (s[i] == 'J') pos[0].push_back(i);
else if (s[i] == 'O') pos[1].push_back(i);
else pos[2].push_back(i);
if (pos[0].size() < k) continue;
int p = get_next(0, 0);
if (p == -1) continue;
p = get_next(1, p+1);
if (p == -1) continue;
p = get_next(2, p+1);
if (p == -1) continue;
ans = min(ans, p-pos[0][0]+1-3*k);
}
if (ans != inf) cout << ans << "\n";
else cout << "-1\n";
}
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... |