oj.uz

Submission #655506

# Submission time Handle Problem Language Result Execution time Memory
655506 2022-11-04T15:19:48 Z PanTkd Rice Hub (IOI11_ricehub) C++14
0 / 100
 1000 ms 340 KB 
#include "ricehub.h"
#include <iostream>
#include <cmath>
typedef int ll;
using namespace std;

bool ok (ll x, ll R,ll L,ll X[],long long B){
  ll i = x;
  ll cost = 0;
  ll med = ((i)/2);
  for(ll j = 0;j<i;j++){
    cost += abs(X[med]-X[j]);
  }
  if(cost<=B){ return 1;}
  for(ll j = 1;j<=R-i;j++){
    med++;
    cost += (i/2-(i-1)/2)*(X[med]-X[med-1]);
    cost += abs(X[med]-X[j+i-1]);
    cost -= abs(X[med-1]-X[j-1]);
    if(cost<=B){return 1;}
  } 
  return 0;
}
int besthub(int R, int L, int X[], long long B)
{
  ll l = 1 ; ll r = R;
  ll anss = 1;
  while(l<=r){
    ll m = (l+r)>>1;

    if (ok(m,R,L,X,B))
    {
      anss = max (anss, ll(m));
      l = m;
    } 
    else{
      r = m - 1;
    }
  }
  return anss;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1087 ms 212 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1083 ms 212 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1091 ms 212 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1055 ms 340 KB Time limit exceeded
2 Halted 0 ms 0 KB -