Submission #418241

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
418241	2021-06-05T08:38:48 Z	temurbek_khujaev	Rice Hub (IOI11_ricehub)	C++17	42 / 100	1000 ms	332 KB

ricehub

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

int besthub(int R, int L, int X[], long long B) {
    int ans = 0;
    for (int i = 0; i < R; i++) {
        long long b = 0;
        for (int j = i; j >= 0; j--) {
            b += X[i] - X[j];

            long long t = 0;
            for (int k = i; k < R; k++) {
                t += X[k] - X[i];
                if ( b + t <= B) {
                    ans = max(ans, k - j + 1);
                }
            }
        }
    }
    return ans;
}

Subtask #1

17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 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	0 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
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	308 KB	Output is correct
9	Correct	0 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	33 ms	308 KB	Output is correct
22	Correct	34 ms	204 KB	Output is correct
23	Correct	33 ms	284 KB	Output is correct
24	Correct	32 ms	204 KB	Output is correct
25	Correct	32 ms	204 KB	Output is correct
26	Correct	32 ms	204 KB	Output is correct
27	Correct	33 ms	204 KB	Output is correct
28	Correct	33 ms	216 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	204 KB	Output is correct
3	Correct	179 ms	292 KB	Output is correct
4	Correct	189 ms	204 KB	Output is correct
5	Correct	33 ms	204 KB	Output is correct
6	Correct	34 ms	204 KB	Output is correct
7	Correct	269 ms	304 KB	Output is correct
8	Correct	257 ms	204 KB	Output is correct
9	Correct	33 ms	204 KB	Output is correct
10	Correct	34 ms	304 KB	Output is correct
11	Correct	133 ms	204 KB	Output is correct
12	Correct	135 ms	292 KB	Output is correct
13	Correct	252 ms	204 KB	Output is correct
14	Correct	250 ms	204 KB	Output is correct
15	Correct	33 ms	204 KB	Output is correct
16	Correct	33 ms	304 KB	Output is correct
17	Correct	130 ms	288 KB	Output is correct
18	Correct	125 ms	204 KB	Output is correct
19	Correct	239 ms	304 KB	Output is correct
20	Correct	243 ms	308 KB	Output is correct
21	Execution timed out	1097 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	1088 ms	332 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-