# | Submission time^{} |
Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|

978410 | 2024-05-09T07:58:06 Z | Newtonabc | Rice Hub (IOI11_ricehub) | C++14 | 80 ms | 4212 KB |

#include "ricehub.h" #include<bits/stdc++.h> using namespace std; int besthub(int R, int L, int X[], long long B) { const int N=1e5+10; long long qs[N]; double tX[N]; int mx=0; qs[0]=X[0]; tX[0]=X[0]; for(int i=1;i<R;i++) qs[i]=X[i]+qs[i-1],tX[i]=X[i]; for(int i=0;i<R;i++){ int l=i,r=R-1; while(l<r){ int mid=(l+r+1)/2; long long sum=qs[mid],bg=0; if(i>0) sum-=qs[i-1]; double mean=(double)sum/(double)(mid-i+1); int ind=lower_bound(tX+i,tX+mid+1,mean)-tX; if(ind-1>=0 && fabs(tX[ind]-mean)>fabs(tX[ind-1]-mean)) ind--; bg=(qs[mid]-qs[ind]-(X[ind]*(mid-ind)))+(X[ind]*(ind-i))-qs[ind-1]; if(i>0) bg+=qs[i-1]; if(bg<=B) l=mid; else r=mid-1; } mx=max(mx,l-i+1); } return mx; }

# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|

1 | Correct | 1 ms | 1884 KB | Output is correct |

2 | Correct | 1 ms | 1884 KB | Output is correct |

3 | Correct | 1 ms | 1884 KB | Output is correct |

4 | Correct | 1 ms | 1884 KB | Output is correct |

5 | Correct | 2 ms | 1880 KB | Output is correct |

# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|

1 | Correct | 1 ms | 1884 KB | Output is correct |

2 | Correct | 1 ms | 1988 KB | Output is correct |

3 | Correct | 1 ms | 1884 KB | Output is correct |

4 | Correct | 1 ms | 1884 KB | Output is correct |

5 | Correct | 1 ms | 1884 KB | Output is correct |

6 | Correct | 1 ms | 1884 KB | Output is correct |

7 | Correct | 1 ms | 1984 KB | Output is correct |

8 | Correct | 1 ms | 1884 KB | Output is correct |

9 | Correct | 1 ms | 1884 KB | Output is correct |

10 | Correct | 1 ms | 1884 KB | Output is correct |

11 | Correct | 1 ms | 1976 KB | Output is correct |

12 | Correct | 1 ms | 1884 KB | Output is correct |

13 | Correct | 1 ms | 1984 KB | Output is correct |

14 | Correct | 1 ms | 1884 KB | Output is correct |

15 | Correct | 2 ms | 1884 KB | Output is correct |

16 | Correct | 2 ms | 1884 KB | Output is correct |

17 | Correct | 1 ms | 1884 KB | Output is correct |

18 | Correct | 1 ms | 1884 KB | Output is correct |

19 | Correct | 1 ms | 1884 KB | Output is correct |

20 | Correct | 1 ms | 1884 KB | Output is correct |

21 | Correct | 1 ms | 1884 KB | Output is correct |

22 | Correct | 1 ms | 1884 KB | Output is correct |

23 | Correct | 1 ms | 1884 KB | Output is correct |

24 | Correct | 1 ms | 1984 KB | Output is correct |

25 | Correct | 1 ms | 1884 KB | Output is correct |

26 | Correct | 2 ms | 1884 KB | Output is correct |

27 | Incorrect | 2 ms | 1884 KB | Output isn't correct |

28 | Halted | 0 ms | 0 KB | - |

# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|

1 | Correct | 1 ms | 1884 KB | Output is correct |

2 | Correct | 1 ms | 1928 KB | Output is correct |

3 | Correct | 1 ms | 1884 KB | Output is correct |

4 | Correct | 2 ms | 1884 KB | Output is correct |

5 | Correct | 2 ms | 1932 KB | Output is correct |

6 | Correct | 1 ms | 1884 KB | Output is correct |

7 | Correct | 2 ms | 1884 KB | Output is correct |

8 | Correct | 1 ms | 1884 KB | Output is correct |

9 | Correct | 1 ms | 1884 KB | Output is correct |

10 | Correct | 1 ms | 1884 KB | Output is correct |

11 | Correct | 1 ms | 1884 KB | Output is correct |

12 | Correct | 2 ms | 1884 KB | Output is correct |

13 | Correct | 1 ms | 1884 KB | Output is correct |

14 | Correct | 1 ms | 1884 KB | Output is correct |

15 | Correct | 2 ms | 1884 KB | Output is correct |

16 | Correct | 2 ms | 1884 KB | Output is correct |

17 | Correct | 1 ms | 1884 KB | Output is correct |

18 | Correct | 1 ms | 1892 KB | Output is correct |

19 | Correct | 2 ms | 1884 KB | Output is correct |

20 | Correct | 2 ms | 1884 KB | Output is correct |

21 | Correct | 4 ms | 1880 KB | Output is correct |

22 | Correct | 4 ms | 1884 KB | Output is correct |

23 | Correct | 4 ms | 1884 KB | Output is correct |

24 | Correct | 3 ms | 1884 KB | Output is correct |

25 | Correct | 4 ms | 2024 KB | Output is correct |

26 | Correct | 4 ms | 1884 KB | Output is correct |

27 | Incorrect | 3 ms | 1884 KB | Output isn't correct |

28 | Halted | 0 ms | 0 KB | - |

# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|

1 | Correct | 5 ms | 1884 KB | Output is correct |

2 | Correct | 5 ms | 1884 KB | Output is correct |

3 | Correct | 44 ms | 4188 KB | Output is correct |

4 | Correct | 42 ms | 4208 KB | Output is correct |

5 | Correct | 36 ms | 4212 KB | Output is correct |

6 | Correct | 35 ms | 4188 KB | Output is correct |

7 | Correct | 66 ms | 4188 KB | Output is correct |

8 | Correct | 65 ms | 4188 KB | Output is correct |

9 | Correct | 37 ms | 4188 KB | Output is correct |

10 | Correct | 37 ms | 4188 KB | Output is correct |

11 | Correct | 80 ms | 4208 KB | Output is correct |

12 | Incorrect | 74 ms | 4188 KB | Output isn't correct |

13 | Halted | 0 ms | 0 KB | - |