Submission #717874

#	Time	Username	Problem	Language	Result	Execution time	Memory
717874		thimote75	쌀 창고 (IOI11_ricehub)	C++14	68 / 100	103 ms	2248 KiB

ricehub

#include "ricehub.h"

#include <bits/stdc++.h>
#define num long long
#define inf 1e18

using namespace std;

int besthub(int R, int L, int X[], num B)
{
    int mxCount = 0;

    for (int idx = 0; idx < R; idx ++) {
      int left  = idx - 1;
      int right = idx + 1;

      num cost  = 0;
      int count = 1;
      while (true) {
        int dcl = left == -1 ? inf : abs(X[left]  - X[idx]);
        int dcr = right == R ? inf : abs(X[right] - X[idx]);

        if (min(dcl, dcr) + cost > B) break ;
        cost  += min(dcl, dcr);
        count ++;
        
        if (dcl <= dcr) left --;
        else right ++;
      }

      mxCount = max(count, mxCount);
    }

    return mxCount;
}

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