Submission #799432

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
799432	2023-07-31T14:15:21 Z	Liudas	Rice Hub (IOI11_ricehub)	C++17	42 / 100	1000 ms	724 KB

ricehub

#include <bits/stdc++.h>
#include "ricehub.h"
using namespace std;
int besthub(int N, int L, int arr[], long long B){
    vector<int> brr;
    for(int i = 0; i < N; i ++){
        brr.push_back(arr[i]);
    }
    int best = 0;
    for(int i = 0; i <= L; i ++){
        int T = B, ans = 0;
        sort(brr.begin(), brr.end(), [&](int a, int b){return abs(a-i) < abs(b-i);});
        for(int j : brr){
            if(abs(j-i) > T)break;
            ans ++;
            T -= abs(j-i);
        }
        best = max(best, ans);
    }
    return best;
}

Subtask #1

17.0 / 17.0

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

Subtask #2

25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	308 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	312 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	312 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	312 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	312 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	320 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	2 ms	212 KB	Output is correct
20	Correct	2 ms	212 KB	Output is correct
21	Correct	6 ms	212 KB	Output is correct
22	Correct	5 ms	212 KB	Output is correct
23	Correct	50 ms	212 KB	Output is correct
24	Correct	53 ms	212 KB	Output is correct
25	Correct	51 ms	212 KB	Output is correct
26	Correct	51 ms	212 KB	Output is correct
27	Correct	48 ms	308 KB	Output is correct
28	Correct	48 ms	212 KB	Output is correct

Subtask #3

0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	14 ms	212 KB	Output is correct
2	Correct	14 ms	316 KB	Output is correct
3	Execution timed out	1088 ms	212 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-

Subtask #4

0 / 32.0

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