Submission #743288

#	Time	Username	Problem	Language	Result	Execution time	Memory
743288		vjudge1	Rice Hub (IOI11_ricehub)	C++17	0 / 100	2 ms	324 KiB

ricehub

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

int besthub(int R, int L, int X[], long long B)
{
  int mid = X[R/2];
  int left = (R/2)-1;
  int right = (R/2)+1;
  int possible = 1;
  int curcost = 0;
  bool breakleft = false;
  bool breakright = false;
  while(breakleft && breakright)
  {
    if(!breakleft and left >= 0 and (mid-X[left]) + curcost <= B)
    {
      curcost += (mid-X[left]);
      left--;
      possible++;
    }
    else
    {
      breakleft = true;
    }
    if(!breakright and right < R and (X[right]-mid) + curcost <= B)
    {
      curcost += (X[right]-mid);
      right--;
      possible++;
    }
    else
    {
      breakright = true;
    }
  }
  return possible;
}

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