Submission #1126051

#	Time	Username	Problem	Language	Result	Execution time	Memory
1126051		m_bezrutchka	쌀 창고 (IOI11_ricehub)	C++20	42 / 100	1088 ms	328 KiB

ricehub

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

int besthub(int R, int L, int X[], long long B)
{
  // sub1
  int resp = 0;
  for (int hub = 1; hub <= L; hub++) {
    vector<int> dists;
    for (int i = 0; i < R; i++) {
      dists.push_back(abs(X[i] - hub));
    }
    sort(dists.begin(), dists.end());
    int cur_resp = 0;
    int money = B;
    for (int i = 0; i < R; i++) {
      if (dists[i] > money) break;
      cur_resp++;
      money -= dists[i];
    }
    resp = max(cur_resp, resp);
  }
  return resp;
}

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