Submission #109859

#	Time	Username	Problem	Language	Result	Execution time	Memory
109859		mohammad	Rice Hub (IOI11_ricehub)	C++14	0 / 100	1075 ms	896 KiB

ricehub

#include "ricehub.h"
#include "iostream"
#include "vector"
#include "map"
#include "math.h"
#include "string"
#include "algorithm"
#include "set"
#include <iterator>
#include <string.h>
#include <queue>
#include <list>

using namespace	std;

typedef long long ll ;
const ll M = 1e9 + 7 ;
const ll oo = 1e13 ;

int besthub(int R, int L, int X[], long long B){
	int best = 0 ;
	for(int i = 1 ; i < L ; ++i){
		int a[10010];
		for(int j = 0 ; j < R ; ++j){
			a[j] = abs(i - X[j]);
		}
		sort(a , a + R);
		int b = B , co = 0;
		while(b){
			if(b > a[co]){
				b -= a[co];
			}else{
				best = max(best , co);
			}
			co++;
		}
	}
	return best;
}

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