Submission #950443

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
950443	2024-03-20T10:13:46 Z	irmuun	Rice Hub (IOI11_ricehub)	C++17	68 / 100	1000 ms	1120 KB

ricehub

#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

int besthub(int R,int L,int X[],ll B){
    int ans=0;
    for(int i=0;i<R;i++){
        ll cost=0;
        int cur=0;
        vector<ll>dist;
        for(int j=0;j<R;j++){
            dist.pb(abs(X[j]-X[i]));
        }
        sort(all(dist));
        for(int j=0;j<R;j++){
            if(cost+dist[j]<=B){
                cost+=dist[j];
                cur++;
            }
            else break;
        }
        ans=max(ans,cur);
    }
    return ans;
}

Subtask #1

17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	600 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	600 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 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	1 ms	348 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 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	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	3 ms	348 KB	Output is correct
22	Correct	3 ms	452 KB	Output is correct
23	Correct	5 ms	456 KB	Output is correct
24	Correct	5 ms	348 KB	Output is correct
25	Correct	4 ms	460 KB	Output is correct
26	Correct	4 ms	344 KB	Output is correct
27	Correct	4 ms	348 KB	Output is correct
28	Correct	5 ms	344 KB	Output is correct

Subtask #3

26.0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	600 KB	Output is correct
3	Correct	21 ms	348 KB	Output is correct
4	Correct	13 ms	344 KB	Output is correct
5	Correct	2 ms	344 KB	Output is correct
6	Correct	3 ms	348 KB	Output is correct
7	Correct	12 ms	348 KB	Output is correct
8	Correct	9 ms	348 KB	Output is correct
9	Correct	4 ms	444 KB	Output is correct
10	Correct	4 ms	348 KB	Output is correct
11	Correct	11 ms	348 KB	Output is correct
12	Correct	11 ms	472 KB	Output is correct
13	Correct	18 ms	348 KB	Output is correct
14	Correct	18 ms	348 KB	Output is correct
15	Correct	4 ms	348 KB	Output is correct
16	Correct	4 ms	348 KB	Output is correct
17	Correct	11 ms	348 KB	Output is correct
18	Correct	11 ms	348 KB	Output is correct
19	Correct	20 ms	604 KB	Output is correct
20	Correct	20 ms	348 KB	Output is correct
21	Correct	273 ms	344 KB	Output is correct
22	Correct	273 ms	344 KB	Output is correct
23	Correct	613 ms	604 KB	Output is correct
24	Correct	607 ms	348 KB	Output is correct
25	Correct	555 ms	604 KB	Output is correct
26	Correct	564 ms	604 KB	Output is correct
27	Correct	511 ms	604 KB	Output is correct
28	Correct	520 ms	600 KB	Output is correct

Subtask #4

0 / 32.0

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