Submission #958094

#	Time	Username	Problem	Language	Result	Execution time	Memory
958094		d4xn	쌀 창고 (IOI11_ricehub)	C++17	68 / 100	12 ms	3680 KiB

ricehub

#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;

int besthub(int R, int L, int X[], long long B)
{ 
  int n = R;
  int ans = 1;

  int l = 0;
  int r = 0;
  int mid = 0;
  int cost = 0;
  int cntL = 1;
  int cntR = 0;
  while (l < n) {
    while (r+1 < n) {
      int prevCost = cost;
      int prevMid = mid;
      int prevCntL = cntL;
      int prevCntR = cntR;

      r++;
      cntR++;
      cost += X[r]-X[mid];

      while (cntL < cntR) {
        int sz = X[mid+1]-X[mid];
        cost += cntL*sz - cntR*sz;
      
        mid++;
        cntL++;
        cntR--;
      }

      if (cost > B) {
        r--;
        cost = prevCost;
        mid = prevMid;
        cntL = prevCntL;
        cntR = prevCntR;
        break;
      }
    }
    ans = max(ans, r-l+1);

    cost -= X[mid]-X[l];
    cntL--;
    l++;
  }

  return ans;
}

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