# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
438876 | Snowfall | JJOOII 2 (JOI20_ho_t2) | C++14 | 35 ms | 3040 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;
char arr[200005];
int a[1000];
int qs[3][200005];
main()
{
int t,p;
a['O']=1;
a['I']=2;
scanf("%d%d",&t,&p);
scanf("%s",&arr[1]);
for(int i = 1;i <= t;i++)
{
qs[a[arr[i]]][i]++;
// printf("%d\n",arr[i]);
for(int j = 0;j < 3;j++)
qs[j][i]+=qs[j][i-1];
}
int mn=1e9;
for(int i = 1;i <= t;i++)
{
int ck=0;
int pv=i;
int sm=0;
for(int j = 0;j < 3 && ck==j;j++)
{
int st=pv,ed=t;
int tmn=1e9;
while(st<=ed)
{
int md=(st+ed)/2;
// printf("%d %d<--\n",qs[j][md],qs[j][pv-1]);
if(qs[j][md]-qs[j][pv-1]>=p)
{
ed=md-1;
tmn=min(tmn,md);
}
else
{
st=md+1;
}
}
// printf("d %d %d %d\n",j,tmn,pv-1);
if(tmn==1e9)
break;
if(qs[j][tmn]-qs[j][pv-1]==p)
{
sm+=tmn-pv+1-p;
ck++;
pv=tmn+1;
}
// printf("%d %d\n",pv,sm);
}
if(ck==3)
mn=min(mn,sm);
}
if(mn!=1e9)
printf("%d",mn);
else
printf("-1");
}
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... |