Submission #788298

#	Time	Username	Problem	Language	Result	Execution time	Memory
788298		mindiyak	쌀 창고 (IOI11_ricehub)	C++14	0 / 100	587 ms	262144 KiB

ricehub

#include "ricehub.h"
#include <iostream>
#include <vector>
#include <set>

using namespace std;

#define ll long long

int besthub(int R, int L, int X[], long long B)
{
  ll ans = 0;
  vector<multiset<int>> pos(L+1,multiset<int>());
  for(ll i=0;i<R;i++){
    for(ll j=max((ll)0,X[i]-B);j<=min((ll)L,X[i]+B);j++){
      pos[j].insert(abs(X[i]-j));
    }
  }

  for(ll i=0;i<L;i++){
    ll sum = 0;
    ll counter = 0;
    for(ll j:pos[i]){
      sum += j;
      if(sum>B){
        ans = max(ans,counter);
      }
      counter++;
    }
  }
  // cout << ans << endl;
  return ans;
}

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