# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
296803 | Bruteforceman | JJOOII 2 (JOI20_ho_t2) | C++11 | 18 ms | 3344 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 inf = 1e9;
string s;
vector <int> solve(char c, int k) {
vector <int> v (s.size());
int r = 0;
int cnt = 0;
for(int i = 0; i < s.size(); i++) {
while(r < s.size() && cnt < k) {
cnt += (s[r] == c);
++r;
}
v[i] = (cnt == k) ? r : inf;
cnt -= (s[i] == c);
}
return v;
}
int main(int argc, char const *argv[])
{
int n, k;
cin >> n >> k;
cin >> s;
map <char, int> cnt;
int r = 0;
int ans = inf;
vector <int> a[3];
a[0] = solve('J', k);
a[1] = solve('O', k);
a[2] = solve('I', k);
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... |