Submission #259452

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
259452	2020-08-07T21:20:45 Z	amiratou	Rice Hub (IOI11_ricehub)	C++14	17 / 100	1000 ms	640 KB

ricehub

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

int cum[100005];
int sum(int a,int b){
	if(a>b)return 0;
	return cum[b]-(a?cum[a-1]:0);
}

int besthub(int R, int L, int X[], long long B)
{
	for (int i = 0; i < R; ++i)
	{
		cum[i]=X[i];
		if(i)cum[i]+=cum[i-1];
	}
	int ans=1;
	for (int i = 0; i < R; ++i)
	{
		for (int j = i+1; j < R; ++j)
		{
			ll x=sum(i,j)/(j-i+1);
			ll idx=lower_bound(X+i,X+j,x)-X;
			ll nb_a=idx-i,nb_b=j-idx+1;
			ll cost=nb_a*x-sum(i,idx-1)+sum(idx,j)-nb_b*x;
			if(cost<=B)ans=max(ans,j-i+1);
			else{
				x=(sum(i,j)+(j-i))/(j-i+1);
				idx=lower_bound(X+i,X+j,x)-X;
				nb_a=idx-i,nb_b=j-idx+1;
				cost=nb_a*x-sum(i,idx-1)+sum(idx,j)-nb_b*x;
				if(cost<=B)ans=max(ans,j-i+1);
			}
		}
	}
	return ans;
}

Subtask #1

17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct

Subtask #2

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	1 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct
15	Correct	0 ms	384 KB	Output is correct
16	Correct	0 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	0 ms	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	6 ms	384 KB	Output is correct
22	Correct	6 ms	384 KB	Output is correct
23	Correct	3 ms	384 KB	Output is correct
24	Correct	4 ms	512 KB	Output is correct
25	Correct	4 ms	384 KB	Output is correct
26	Correct	4 ms	384 KB	Output is correct
27	Incorrect	5 ms	384 KB	Output isn't correct
28	Halted	0 ms	0 KB	-

Subtask #3

0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	8 ms	384 KB	Output is correct
4	Correct	8 ms	384 KB	Output is correct
5	Correct	8 ms	384 KB	Output is correct
6	Correct	7 ms	384 KB	Output is correct
7	Correct	24 ms	384 KB	Output is correct
8	Correct	24 ms	392 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	14 ms	384 KB	Output is correct
12	Correct	13 ms	384 KB	Output is correct
13	Correct	13 ms	384 KB	Output is correct
14	Correct	13 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	9 ms	384 KB	Output is correct
18	Correct	9 ms	384 KB	Output is correct
19	Correct	14 ms	384 KB	Output is correct
20	Correct	14 ms	384 KB	Output is correct
21	Correct	761 ms	504 KB	Output is correct
22	Correct	775 ms	432 KB	Output is correct
23	Correct	369 ms	384 KB	Output is correct
24	Correct	361 ms	504 KB	Output is correct
25	Correct	366 ms	504 KB	Output is correct
26	Incorrect	383 ms	384 KB	Output isn't correct
27	Halted	0 ms	0 KB	-

Subtask #4

0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1094 ms	640 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-