제출 #684349

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
684349		speedyArda	쌀 창고 (IOI11_ricehub)	C++14	100 / 100	15 ms	2260 KiB

ricehub

#include "ricehub.h"
#include "bits/stdc++.h"

using namespace std;
using ll = long long;
int besthub(int R, int L, int X[], long long B)
{

  ll pref[R];
  ll Big[R];
  pref[0] = 0;
  for(int i = 0; i < R; i++)
  {
      if(i > 0)
        pref[i] = pref[i - 1];
      pref[i] += X[i];
      Big[i] = X[i];
  }

  int left = 1, right = R;
  int ans = 0;
  while(left <= right)
  {
    int m = (left + right) / 2; // We are controlling whether we can get m rices. We use binary search because rice count is monotonic. For example, we can get 6 rices, if we can get 7 rices.
    //int mid = 1;
    bool valid = false;
    for(int i = 0; i + m - 1 < R; i++)
    {
      ll mid = i + (m-1) / 2;
      ll price = Big[mid] * (mid - i + 1) - (pref[mid] - pref[i - 1]);
      price += (pref[i + m - 1] - pref[mid]) - Big[mid] * (i + m - 1 - mid);
      if(price <= B)
        valid = true;
    }

    

    if(valid) {
      left = m + 1;
      ans = m;
    }
    else
      right = m - 1;

  }
  return ans;
}



 

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