Submission #1352464

#TimeUsernameProblemLanguageResultExecution timeMemory
1352464vyaductRice Hub (IOI11_ricehub)C++20
42 / 100
1095 ms440 KiB
#include <bits/stdc++.h>
using namespace std;
#include "ricehub.h"
#define all(c) (c).begin(), (c).end()

int besthub(int R, int L, int X[], long long B)
{
  int ans = 1;
  for (int x = 1; x <= L; x++){
    vector<int> distances;
    for (int i=0;i<R;i++) distances.push_back(abs(X[i]-x));
    sort(all(distances));
    int cnt = 0;
    int sum = 0;
    for (int d: distances){
      if (sum+d>B) break;
      cnt++;
      sum+=d;
    }
    ans = max(ans, cnt);
  }
  return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...