Submission #407249

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
407249	2021-05-18T16:32:59 Z	danielcm585	Rice Hub (IOI11_ricehub)	C++14	0 / 100	27 ms	2400 KB

ricehub

#include "ricehub.h"

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;

int besthub(int R, int L, int X[], ll B) {
    sort(X,X+R);
    int ans = 0;
    vector<int> v;
    for (int i = 0; i < R; i++) v.push_back(abs(X[i]-X[R/2]));
    sort(v.begin(),v.end());
    for (int i : v) {
        if (B < i) break;
        ans++;
        B -= i;
    }
    return ans;
}

Subtask #1

0 / 17.0

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

Subtask #2

0 / 25.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	256 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	312 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Incorrect	1 ms	204 KB	Output isn't correct
20	Halted	0 ms	0 KB	-

Subtask #3

0 / 26.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	312 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	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	308 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Incorrect	1 ms	204 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #4

0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	632 KB	Output is correct
2	Correct	5 ms	716 KB	Output is correct
3	Correct	26 ms	2376 KB	Output is correct
4	Correct	27 ms	2348 KB	Output is correct
5	Correct	9 ms	1220 KB	Output is correct
6	Correct	9 ms	1228 KB	Output is correct
7	Correct	21 ms	2120 KB	Output is correct
8	Correct	20 ms	2100 KB	Output is correct
9	Correct	12 ms	1100 KB	Output is correct
10	Correct	12 ms	1100 KB	Output is correct
11	Correct	26 ms	2376 KB	Output is correct
12	Correct	26 ms	2400 KB	Output is correct
13	Incorrect	11 ms	1260 KB	Output isn't correct
14	Halted	0 ms	0 KB	-