제출 #964531

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
964531		UmairAhmadMirza	쌀 창고 (IOI11_ricehub)	C++14	100 / 100	10 ms	3676 KiB

ricehub

#include <bits/stdc++.h>
using namespace std;
long long const inf=1e16;
int const N=1e5+5;
long long pre[N];
int cor[N];
long long bug=0;
bool cost(int l,int r){
	// cout<<l<<' '<<r<<" checking for it"<<endl;
	int p=(l+r)/2;
	// cout<<p<<" hub"<<endl;
	long long c=0;
	int s1=p-l;
	int s2=(r+1)-p;
	long long sm1=(cor[p]*s1)-(pre[p]-pre[l]);
	long long sm2=(pre[r+1]-pre[p])-(cor[p]*s2);
	c=sm1+sm2;
	// cout<<c<<endl;
	return (c<=bug);
}
int besthub(int R, int L, int X[], long long B){
	bug=B;
	for (int i = 0; i < R; ++i){
		pre[i+1]=pre[i]+X[i];
		cor[i]=X[i];
	}
	int low=1,high=R+1;
	while(high-low>1){
		int mid=(high+low)/2;
		// cout<<mid<<' '<<" mid"<<endl;
		bool b=0;
		for (int i = 0; (i+mid)-1 < R; ++i)
			b|=cost(i,(i+mid)-1);
		if(b)
			low=mid;
		else
			high=mid;
	}
	return low;
}

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