Submission #259475

#	Time	Username	Problem	Language	Result	Execution time	Memory
259475		amiratou	Rice Hub (IOI11_ricehub)	C++14	68 / 100	1084 ms	640 KiB

ricehub

#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
ll d[100005];

int besthub(int R, int L, int X[], long long B)
{
	int ans=1;
	for (int i = 0; i < R; ++i)
	{
		for (int j = 0; j < R; ++j)
			d[j]=abs(X[j]-X[i]);
		sort(d,d+R);
		ll rem=B;
		int cnt=0;
		for (int j = 0; j < R; ++j)
		{
			if(d[j]>rem)break;
			else rem-=d[j],cnt++;
		}
		ans=max(ans,cnt);
	}
	return ans;
}

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