oj.uz

Submission #468599

# Submission time Handle Problem Language Result Execution time Memory
468599 2021-08-29T00:26:09 Z Maurimuri80 Rice Hub (IOI11_ricehub) C++14
0 / 100
 1000 ms 460 KB 
#include "ricehub.h"
#include <cmath>
#include <vector>
using namespace std;

int besthub(int R, int L, int X[], long long B)
{
  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];
  }
  int min, max, med;
  min = 1;
  max = R;

  while (true)
  {
    if (min == max or min > max)
    {
      return min;
    }
    med = (min + max) / 2;
    //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
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Execution timed out 1091 ms 204 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Execution timed out 1085 ms 204 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1085 ms 204 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 1092 ms 460 KB Time limit exceeded
2 Halted 0 ms 0 KB -