Submission #98083

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
98083	2019-02-20T14:29:51 Z	SpeedOfMagic	Rice Hub (IOI11_ricehub)	C++17	68 / 100	23 ms	2552 KB

ricehub

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

int besthub(int R, int L, int X[], long long B) {
	long long pref[R];
	for (int i = 0; i < R; i++)
		pref[i] = (i ? pref[i - 1] : 0) + X[i];
	int l = 0, ans = 0;
	for (int r = 0; r < R; r++) {
		int med = (r - l) / 2 + l;
		long long cost = (long long) X[med] * (med - l + 1) - (pref[med] - pref[l] + X[l]);
		cost += pref[r] - pref[med] - X[med] * (r - med);
		
		if (cost > B) {
			l++;
			r--;
		} else
			ans = max(ans, r - l + 1);
	}
	return ans;
}

Subtask #1

17.0 / 17.0

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

Subtask #2

25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	256 KB	Output is correct
2	Correct	3 ms	384 KB	Output is correct
3	Correct	3 ms	256 KB	Output is correct
4	Correct	3 ms	256 KB	Output is correct
5	Correct	3 ms	256 KB	Output is correct
6	Correct	3 ms	256 KB	Output is correct
7	Correct	2 ms	372 KB	Output is correct
8	Correct	2 ms	256 KB	Output is correct
9	Correct	3 ms	356 KB	Output is correct
10	Correct	3 ms	384 KB	Output is correct
11	Correct	3 ms	256 KB	Output is correct
12	Correct	2 ms	256 KB	Output is correct
13	Correct	3 ms	384 KB	Output is correct
14	Correct	2 ms	256 KB	Output is correct
15	Correct	3 ms	384 KB	Output is correct
16	Correct	2 ms	384 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	384 KB	Output is correct
19	Correct	2 ms	384 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	2 ms	256 KB	Output is correct
22	Correct	2 ms	256 KB	Output is correct
23	Correct	3 ms	256 KB	Output is correct
24	Correct	3 ms	256 KB	Output is correct
25	Correct	3 ms	256 KB	Output is correct
26	Correct	3 ms	384 KB	Output is correct
27	Correct	2 ms	384 KB	Output is correct
28	Correct	2 ms	256 KB	Output is correct

Subtask #3

26.0 / 26.0

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

Subtask #4

0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	640 KB	Output is correct
2	Correct	7 ms	640 KB	Output is correct
3	Correct	22 ms	2552 KB	Output is correct
4	Incorrect	23 ms	2552 KB	Output isn't correct
5	Halted	0 ms	0 KB	-