Submission #469133

#	Time	Username	Problem	Language	Result	Execution time	Memory
469133		Maurimuri80	Rice Hub (IOI11_ricehub)	C++14	100 / 100	19 ms	2516 KiB

ricehub

#include "ricehub.h"
#include <cmath>
#include <vector>
#include <iostream>
using namespace std;

int besthub(int R, int L, int X[], long long B)
{
  // cout << "Hello" << endl;
  vector<long long> ac(R + 1);
  ac[0] = 0;
  for (int i = 1; i <= R; i++)
  {
    ac[i] = ac[i - 1] + (long long)X[i - 1];
  }
  long long min, max, med;
  min = 1;
  max = R;
  // cout<<"Hello"<<endl;
  while (true)
  {
    if (min == max or min > max)
    {
      return min;
    }
    med = ((min + max) / 2 )+1;
    // cout<<med<<endl;
    //hallamos la mitad de los posible y no posible
    bool possible = false;
    for (int i = 0; i <= R - med; i++)
    {
      long long izq = i;
      long long der = i + med - 1;
      long long mid = (izq + der) / 2;
      long long aux = (mid - izq);
      long long aux2 = (der - mid);
      long long rm = X[mid];
      long long sum = ((aux - aux2) * rm) - (ac[mid] - ac[izq]) + (ac[der + 1] - ac[mid + 1]);
      if (sum <= B)
      {
        possible = true;
        break;
      }
    }
    if (possible == true)
    {
      min = med;
    }
    else
    {
      max = med - 1;
    }
  }
  return 1;
}

• Subtask 1: 17 / 17
• Subtask 2: 25 / 25
• Subtask 3: 26 / 26
• Subtask 4: 32 / 32