oj.uz

Submission #936154

# Submission time Handle Problem Language Result Execution time Memory
936154 2024-03-01T09:33:32 Z AtabayRajabli Rice Hub (IOI11_ricehub) C++17
0 / 100
 3 ms 2652 KB 
#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;

long long p[100005];

long long cost(int l, int r)
{
  int m = (l + r) >> 1;
  int med = p[m] - p[m - 1];
  return med * (m - l + 1) - (p[m] - p[l - 1]) + p[r] - p[m] - med * (r - m);
}

int besthub(int R, int L, int X[], long long B)
{
  for(int i = 0; i < R; i++)
  {
    p[i] = X[i] + (i > 0 ? p[i - 1] : 0LL);
  }
  int r = 0;
  long long ans = 0;
  for(int l = 0; l < R; l++)
  {
    while(r < R && cost(l, r) <= B)
    {
      ans = max(ans, cost(l, r));
      r++;
    }
  }
  return ans;
}

Subtask #1
0 / 17.0

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

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2396 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 2396 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 2652 KB Output isn't correct
2 Halted 0 ms 0 KB -