Submission #525330

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
525330	2022-02-11T10:29:24 Z	prvocislo	Rice Hub (IOI11_ricehub)	C++17	100 / 100	13 ms	2500 KB

ricehub

#include "ricehub.h"
#include <algorithm>
#include <iostream>
#include <string>
#include <random>
#include <chrono>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
#include <queue>
#include <bitset>
#include <cmath>
#include <cassert>
typedef long long ll;
typedef long double ld;
using namespace std;

const int maxr = 1e5 + 5;
ll pf[maxr];
ll sum(int l, int r)
{
	return pf[r + 1] - pf[l];
}
bool check(int r, int l, ll b, int k)
{
	for (int i = 0; i + k <= r; i++)
	{
		ll s = sum(i + k - k / 2, i + k - 1) - sum(i, i + k / 2 - 1);
		if (s <= b) return true;
	}
	return false;
}
int besthub(int r, int l, int x[], ll b)
{
	for (int i = 0; i <= r; i++) pf[i + 1] = pf[i] + x[i];
	int lo = 1, hi = r;
	while (lo < hi)
	{
		int mi = (lo + hi + 1) / 2;
		if (check(r, l, b, mi)) lo = mi;
		else hi = mi - 1;
	}
	return lo;
}

Subtask #1

17.0 / 17.0

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

Subtask #2

25.0 / 25.0

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

Subtask #3

26.0 / 26.0

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

Subtask #4

32.0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	692 KB	Output is correct
2	Correct	4 ms	588 KB	Output is correct
3	Correct	12 ms	2484 KB	Output is correct
4	Correct	10 ms	2420 KB	Output is correct
5	Correct	5 ms	1220 KB	Output is correct
6	Correct	5 ms	1220 KB	Output is correct
7	Correct	9 ms	2116 KB	Output is correct
8	Correct	9 ms	2228 KB	Output is correct
9	Correct	5 ms	1160 KB	Output is correct
10	Correct	5 ms	1068 KB	Output is correct
11	Correct	10 ms	2500 KB	Output is correct
12	Correct	11 ms	2464 KB	Output is correct
13	Correct	5 ms	1240 KB	Output is correct
14	Correct	5 ms	1228 KB	Output is correct
15	Correct	11 ms	1988 KB	Output is correct
16	Correct	8 ms	1868 KB	Output is correct
17	Correct	10 ms	2220 KB	Output is correct
18	Correct	10 ms	2216 KB	Output is correct
19	Correct	10 ms	2376 KB	Output is correct
20	Correct	13 ms	2384 KB	Output is correct