Submission #655500

#	Time	Username	Problem	Language	Result	Execution time	Memory
655500		PanTkd	쌀 창고 (IOI11_ricehub)	C++14	68 / 100	1091 ms	596 KiB

ricehub

#include "ricehub.h"
#include <iostream>
#include <cmath>
typedef long long ll;
using namespace std;

int besthub(int R, int L, int X[], long long B)
{
  for(ll i = R;i>=1;i--){
    ll cost = 0;
    ll med = ((i)/2);
    //cout<<i<<"----\n";
    for(ll j = 0;j<i;j++){
      cost += abs(X[med]-X[j]);
    }
    if(cost<=B){ return i;}
    for(ll j = 1;j<=R-i;j++){
      med++;
      cost += (i/2-(i-1)/2)*(X[med]-X[med-1]);
      cost += abs(X[med]-X[j+i-1]);
      cost -= abs(X[med-1]-X[j-1]);
      if(cost<=B){return i;}
    } 
  }
  return 1;
}

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