oj.uz

Submission #737208

# Submission time Handle Problem Language Result Execution time Memory
737208 2023-05-06T20:43:42 Z ETheBest3 Rice Hub (IOI11_ricehub) C++14
0 / 100
 3 ms 612 KB 
#include<bits/stdc++.h>
#include "ricehub.h"
#define lli long long
const lli MAXN=100005;
lli pref[MAXN];
int besthub(int R, int L, int X[], long long B)
{
  for(lli i=0; i<R; i++){
    if(i==0)pref[i]=X[i];
    else pref[i]=pref[i-1]+X[i];
  }
  lli p1=0, p2=0, p3=0, now=0, sum=0, ans=0;
  for(;p2<R; p2++){
      now=pref[p2]/(p2+1);
      while(p3<p2 and X[p3+1]<=now)p3++;
      sum=(pref[p2]-pref[p3])-now*(p2-p3)+now*(p3)-pref[p3];
      if(sum>B)break;
  }
  if(sum<=B)return p2;
  ans=p2;
  p2--;
  for(p1=0;p1<R; p1++){
    if(p2<p1+1)p2=p1+1;
    for(;p2<R; p2++){
      now=(pref[p2]-pref[p1])/(p2-p1);
      while(p3<p2 and X[p3+1]<=now)p3++;
      sum=(pref[p2]-pref[p3])-now*(p2-p3)+now*(p3-p1)-(pref[p3]-pref[p1]);
      if(sum>B)break;
    }
    if(ans<p2-p1-1)ans=p2-p1-1;
    p2--;
  }
  return ans;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 612 KB Output isn't correct
2 Halted 0 ms 0 KB -