제출 #80512

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
80512		arman_ferdous	쌀 창고 (IOI11_ricehub)	C++17	51 / 100	1082 ms	1656 KiB

ricehub

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

typedef long long ll;
int n; ll place, cap;
vector<int> v;

bool cmp(int a, int b) {
	return abs(a-place) < abs(b-place);
}

int calc(ll x) {
	place = x;
	sort(v.begin(),v.end(),cmp);
	ll have = cap; int ret = 0;
	for(int i = 0; i < n; i++) {
		if(abs(v[i]-x) > have) break;
		have -= abs(v[i]-x);
		ret++;
	} return ret;
}

int besthub(int R, int L, int X[], ll B) {
	n = R; cap = B;
	for(int i = 0; i < R; i++) v.push_back(X[i]);

	int lo = 0, hi = L;
	while(hi - lo >= 10) {
		int mid1 = (lo + lo + hi)/3;
		int mid2 = (lo + hi + hi)/3;
		int got1 = calc(mid1), got2 = calc(mid2);
		if(got1 > got2) hi = mid2 - 1;
		else lo = mid1 + 1;
	}
	int ret = 0;
	for(int i = lo; i <= hi; i++)
		ret = max(ret , calc(i));
	return ret;
}

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