Submission #820104

#	Time	Username	Problem	Language	Result	Execution time	Memory
820104		nemethm	Rice Hub (IOI11_ricehub)	C++17	42 / 100	1092 ms	636 KiB

ricehub

    #include "ricehub.h"
    #include <bits/stdc++.h>
     
    using namespace std;
     
    using ll = long long int;
     
    int besthub(int R, int L, int X[], long long B)
    {
      int ans = 0;
      for(int i = 0; i < R; ++i){
        priority_queue<int> q;
        for(int j = 0; j < R; ++j){
          q.push(-abs(X[i] - X[j]));
        }
        ll cost = 0;
        int actual = 0;
        while(!q.empty() && cost + (-q.top()) <= B){
          ++actual;
          cost += -q.top();
          q.pop();
        }
        ans = max(ans, actual);
      }
      return ans;
    }

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