Submission #580856

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
580856	2022-06-22T02:26:10 Z	benson1029	Rice Hub (IOI11_ricehub)	C++14	0 / 100	14 ms	1752 KB

ricehub

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

long long sum = 0;

int besthub(int R, int L, int X[], long long B)
{
	sort(X, X+R);
	int ptr = 0;
	int ans = 0;
	for(int i=0; i<R; i++) {
		if(ptr < i) {
			ptr = i;
			sum = 0;
		}
		while(ptr<R-1 && sum - X[(i+ptr+1)/2] + X[ptr+1] <= B) {
			sum = sum - X[(i+ptr+1)/2] + X[ptr+1];
			ptr++;
		}
		ans = max(ans, ptr-i+1);
		sum = sum + X[i] - X[(i+ptr)/2];
	}
	return ans;
}

Subtask #1

0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Incorrect	1 ms	212 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #2

0 / 25.0

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

Subtask #3

0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Incorrect	1 ms	212 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #4

0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	340 KB	Output is correct
2	Correct	3 ms	524 KB	Output is correct
3	Correct	14 ms	1748 KB	Output is correct
4	Correct	13 ms	1696 KB	Output is correct
5	Correct	5 ms	812 KB	Output is correct
6	Correct	5 ms	852 KB	Output is correct
7	Correct	11 ms	1452 KB	Output is correct
8	Correct	12 ms	1364 KB	Output is correct
9	Correct	6 ms	736 KB	Output is correct
10	Correct	6 ms	712 KB	Output is correct
11	Correct	14 ms	1752 KB	Output is correct
12	Correct	12 ms	1728 KB	Output is correct
13	Incorrect	6 ms	888 KB	Output isn't correct
14	Halted	0 ms	0 KB	-