Submission #1003266

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1003266	2024-06-20T08:20:34 Z	ayankarimova	Rice Hub (IOI11_ricehub)	C++14	68 / 100	1000 ms	940 KB

ricehub

#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
const ll sz=50005;
ll a[sz], b[sz], d[sz], s[sz];
int besthub(int r, int l, int x[], long long k)
{

    ll ans=0;
    for(int i=0; i<r; i++){
        vector<ll>v;
        for(int j=0; j<r; j++){
            v.push_back(abs(x[i]-x[j]));
        }
        sort(v.begin(), v.end());
        ll sum=0;
        for(int j=0; j<r; j++){
            if(sum+v[j]>k) break;
            sum+=v[j];
            ans=max(ans, (ll)j+1);
        }
    }
    return ans;
}
/*
{} []
5 20 6

1 2 10 12 14 3
*/

Subtask #1

17.0 / 17.0

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

Subtask #2

25.0 / 25.0

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

Subtask #3

26.0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	12 ms	468 KB	Output is correct
4	Correct	12 ms	460 KB	Output is correct
5	Correct	2 ms	344 KB	Output is correct
6	Correct	2 ms	348 KB	Output is correct
7	Correct	7 ms	348 KB	Output is correct
8	Correct	7 ms	344 KB	Output is correct
9	Correct	3 ms	344 KB	Output is correct
10	Correct	3 ms	348 KB	Output is correct
11	Correct	8 ms	348 KB	Output is correct
12	Correct	8 ms	344 KB	Output is correct
13	Correct	14 ms	348 KB	Output is correct
14	Correct	14 ms	348 KB	Output is correct
15	Correct	3 ms	456 KB	Output is correct
16	Correct	3 ms	348 KB	Output is correct
17	Correct	8 ms	460 KB	Output is correct
18	Correct	8 ms	348 KB	Output is correct
19	Correct	14 ms	348 KB	Output is correct
20	Correct	16 ms	348 KB	Output is correct
21	Correct	327 ms	348 KB	Output is correct
22	Correct	325 ms	548 KB	Output is correct
23	Correct	604 ms	548 KB	Output is correct
24	Correct	597 ms	592 KB	Output is correct
25	Correct	564 ms	544 KB	Output is correct
26	Correct	543 ms	552 KB	Output is correct
27	Correct	486 ms	600 KB	Output is correct
28	Correct	496 ms	552 KB	Output is correct

Subtask #4

0 / 32.0

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