Submission #418205

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
418205	2021-06-05T08:14:54 Z	dxz05	Rice Hub (IOI11_ricehub)	C++14	42 / 100	1000 ms	460 KB

ricehub

#include "ricehub.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int besthub(int N, int L, int X[], long long B) {
    int ans = 0;
    for (int l = 0; l < N; l++){
        for (int r = l; r < N; r++){
            ll cur = 0, x = X[(l + r) / 2];
            for (int i = l; i <= r; i++){
                cur += abs(X[i] - x);
            }
            if (cur <= B){
                ans = max(ans, r - l + 1);
            }
        }
    }

    return ans;
}

Subtask #1

17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 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	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	1 ms	304 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	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	308 KB	Output is correct
8	Correct	1 ms	204 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	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	23 ms	300 KB	Output is correct
22	Correct	24 ms	204 KB	Output is correct
23	Correct	24 ms	300 KB	Output is correct
24	Correct	32 ms	204 KB	Output is correct
25	Correct	28 ms	204 KB	Output is correct
26	Correct	32 ms	204 KB	Output is correct
27	Correct	25 ms	204 KB	Output is correct
28	Correct	28 ms	288 KB	Output is correct

Subtask #3

0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	204 KB	Output is correct
2	Correct	2 ms	304 KB	Output is correct
3	Correct	144 ms	292 KB	Output is correct
4	Correct	145 ms	288 KB	Output is correct
5	Correct	26 ms	300 KB	Output is correct
6	Correct	29 ms	304 KB	Output is correct
7	Correct	196 ms	300 KB	Output is correct
8	Correct	182 ms	292 KB	Output is correct
9	Correct	24 ms	288 KB	Output is correct
10	Correct	38 ms	204 KB	Output is correct
11	Correct	96 ms	296 KB	Output is correct
12	Correct	112 ms	296 KB	Output is correct
13	Correct	206 ms	288 KB	Output is correct
14	Correct	202 ms	288 KB	Output is correct
15	Correct	26 ms	304 KB	Output is correct
16	Correct	24 ms	300 KB	Output is correct
17	Correct	93 ms	288 KB	Output is correct
18	Correct	104 ms	292 KB	Output is correct
19	Correct	186 ms	288 KB	Output is correct
20	Correct	178 ms	308 KB	Output is correct
21	Execution timed out	1075 ms	332 KB	Time limit exceeded
22	Halted	0 ms	0 KB	-

Subtask #4

0 / 32.0

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