Submission #743322

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
743322	2023-05-17T09:47:33 Z	vjudge1	Rice Hub (IOI11_ricehub)	C++17	42 / 100	1000 ms	848 KB

ricehub

#include<bits/stdc++.h>
#include "ricehub.h"
using namespace std;
int besthub(int R, int L, int X[], long long B)
{
    int mx = -1;
    for(int i=0;i<=R;++i)
    {
        priority_queue<long long,vector<long long>,greater<long long>> pq;
        for(int j=0;j<R;++j)
        {
            long long dist = abs(X[i]-X[j]);
            pq.push(dist);
        }
        long long cost = 0;
        int rice = 0;
        while(!pq.empty())
        {
            if(cost+pq.top() <= B)
            {
                cost += pq.top();
                ++rice;
            }
            else break;
            pq.pop();
        }
        mx = max(mx,rice);
    }
    return mx;
}

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	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct

Subtask #2

25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 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	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	0 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	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	5 ms	212 KB	Output is correct
22	Correct	4 ms	212 KB	Output is correct
23	Correct	12 ms	316 KB	Output is correct
24	Correct	12 ms	212 KB	Output is correct
25	Correct	11 ms	212 KB	Output is correct
26	Correct	12 ms	312 KB	Output is correct
27	Correct	7 ms	212 KB	Output is correct
28	Correct	7 ms	212 KB	Output is correct

Subtask #3

0 / 26.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	47 ms	308 KB	Output is correct
4	Correct	44 ms	316 KB	Output is correct
5	Correct	3 ms	212 KB	Output is correct
6	Correct	3 ms	308 KB	Output is correct
7	Correct	13 ms	332 KB	Output is correct
8	Correct	11 ms	332 KB	Output is correct
9	Correct	5 ms	212 KB	Output is correct
10	Correct	6 ms	312 KB	Output is correct
11	Correct	13 ms	332 KB	Output is correct
12	Correct	13 ms	316 KB	Output is correct
13	Correct	61 ms	212 KB	Output is correct
14	Correct	56 ms	212 KB	Output is correct
15	Correct	7 ms	212 KB	Output is correct
16	Correct	8 ms	212 KB	Output is correct
17	Correct	38 ms	316 KB	Output is correct
18	Correct	35 ms	316 KB	Output is correct
19	Correct	62 ms	316 KB	Output is correct
20	Correct	58 ms	312 KB	Output is correct
21	Correct	272 ms	440 KB	Output is correct
22	Correct	284 ms	452 KB	Output is correct
23	Execution timed out	1078 ms	348 KB	Time limit exceeded
24	Halted	0 ms	0 KB	-

Subtask #4

0 / 32.0

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