# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
229481 | kshitij_sodani | Rice Hub (IOI11_ricehub) | C++17 | 31 ms | 2688 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>
#include <iostream>
using namespace std;
typedef long long llo;
#define mp make_pair
#define a first
#define b second
#define pb push_back
#include <ricehub.h>
llo it[100001];
llo pre[100001];
llo n;
llo bb;
llo check(llo st,llo en){
llo mi=st+(en-st)/2;
llo co=(mi-st+1)*it[mi];
if(st==0){
co-=pre[mi];
}
else{
co-=(pre[mi]-pre[st-1]);
}
co-=(en-mi+1)*it[mi];
if(mi==0){
co+=pre[en];
}
else{
co+=(pre[en]-pre[mi-1]);
}
return co<=bb;
}
int besthub(int nn,int coo,int tt[],llo b){
n=(llo)nn;
llo l,r;
llo tot=0;
llo ma=0;
bb=b;
for(llo i=0;i<n;i++){
it[i]=(llo)tt[i];
}
pre[0]=it[0];
for(llo i=1;i<n;i++){
pre[i]=pre[i-1]+it[i];
}
for(llo i=0;i<n;i++){
llo low=i;
llo high=n-1;
llo mid=(low+high)/2;
if(check(i,mid)){
low=mid;
}
else{
high=mid-1;
}
llo ans=low;
if(check(i,high)){
ans=high;
}
ma=max(ma,ans-i+1);
}
return ma;
/* for(llo i=0;i<n;i++){
if(i==0){
l=0;
r=-1;
for(llo j=0;j<n;j++){
if(tot+it[j]-it[0]<=b){
tot+=(it[j]-it[0]);
r+=1;
}
else{
break;
}
}
ma=max(ma,r-l+1);
}
else{
tot+=abs(it[i]-it[i-1])*abs(l-i);
tot-=abs(it[i]-it[i-1])*abs(r-i+1);
llo llp=l;
for(int j=llp;j<i;j++){
if(tot>b){
tot-=abs(it[j]-it[i]);
l+=1;
}
else{
break;
}
}
int rr=r;
for(llo j=rr+1;j<n;j++){
if(abs(it[j]-it[i])<=abs(it[i]-it[l])){
r+=1;
tot+=abs(it[j]-it[i]);
if(tot>b){
l+=1;
tot-=abs(it[i]-it[l-1]);
}
}
else if(abs(it[j]-it[i])+tot<=b){
r+=1;
tot+=abs(it[j]-it[i]);
}
else{
break;
}
}
ma=max(ma,r-l+1);
}
}*/
return ma;
}
/*int main(){
llo cc[5];
cc[0]=1;
cc[1]=2;
cc[2]=10;
cc[3]=12;
cc[4]=14;
cout<<besthub(5,20,cc,(llo)6)<<endl;
int r,l;
llo b;
cin>>r>>l>>b;
int ac[r];
for(int i=0;i<r;i++){
cin>>ac[i];
}
cout<<besthub(r,l,ac,b)<<endl;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |