oj.uz

Submission #743314

# Submission time Handle Problem Language Result Execution time Memory
743314 2023-05-17T09:45:36 Z vjudge1 Rice Hub (IOI11_ricehub) C++17
42 / 100
 1000 ms 808 KB 
#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=1;i<=L;++i)
    {
        priority_queue<long long,vector<long long>,greater<long long>> pq;
        for(int j=0;j<R;++j)
        {
            long long dist = abs(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 0 ms 212 KB Output is correct
2 Correct 0 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 212 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 272 KB Output is correct
5 Correct 2 ms 212 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 4 ms 212 KB Output is correct
8 Correct 3 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 3 ms 304 KB Output is correct
16 Correct 3 ms 212 KB Output is correct
17 Correct 2 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 3 ms 212 KB Output is correct
20 Correct 4 ms 212 KB Output is correct
21 Correct 8 ms 316 KB Output is correct
22 Correct 9 ms 212 KB Output is correct
23 Correct 198 ms 296 KB Output is correct
24 Correct 188 ms 296 KB Output is correct
25 Correct 189 ms 212 KB Output is correct
26 Correct 188 ms 300 KB Output is correct
27 Correct 99 ms 212 KB Output is correct
28 Correct 98 ms 300 KB Output is correct

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 212 KB Output is correct
2 Correct 24 ms 212 KB Output is correct
3 Execution timed out 1066 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 1059 ms 808 KB Time limit exceeded
2 Halted 0 ms 0 KB -