# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
228488 | Ruxandra985 | JJOOII 2 (JOI20_ho_t2) | C++14 | 38 ms | 6380 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>
#define DIMN 200010
using namespace std;
char s[DIMN];
int fi[DIMN] , fj[DIMN] , fo[DIMN];
vector <pair <int,int> > vi , vj;
int main()
{
FILE *fin = stdin;
FILE *fout = stdout;
int n , k , i , st , dr , mid , j , sol;
fscanf (fin,"%d%d\n",&n,&k);
fgets (s + 1 , n + 10 , fin);
for (i = 1 ; i <= n ; i++){
fj[i] = fj[i - 1];
fo[i] = fo[i - 1];
fi[i] = fi[i - 1];
if (s[i] == 'J')
fj[i]++;
else if (s[i] == 'O')
fo[i]++;
else fi[i]++;
}
sol = n;
for (i = 1 ; i <= n ; i++){
st = i;
dr = n;
while (st <= dr){
mid = (st + dr)/2;
if (fj[mid] - fj[i - 1] >= k)
dr = mid - 1;
else st = mid + 1;
}
if (st <= n)
vj.push_back(make_pair(st , st - i + 1 - k));
/// --------------------------------------------------------------------
/// --------------------------------------------------------------------
st = i;
dr = n;
while (st <= dr){
mid = (st + dr)/2;
if (fi[mid] - fi[i - 1] >= k)
dr = mid - 1;
else st = mid + 1;
}
if (st <= n)
vi.push_back(make_pair( i , st - i + 1 - k ));
}
/// vj si vi sunt in ordine crescatoare
j = 0;
for (i = 0 ; i < vj.size() ; i++){
while (j < vi.size() && fo[vi[j].first - 1] - fo[vj[i].first] < k)
j++;
if (j == vi.size())
break;
//printf ("%d %d\n" , vi[j].first - 1 , vj[i].first + 1);
sol = min(sol , vi[j].second + vj[i].second + vi[j].first - 1 - vj[i].first - k);
}
if (sol == n)
sol = -1;
fprintf (fout,"%d",sol);
return 0;
}
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... |