oj.uz

Submission #261536

# Submission time Handle Problem Language Result Execution time Memory
261536 2020-08-11T20:36:36 Z s_avila_g Rice Hub (IOI11_ricehub) C++14
42 / 100
 1000 ms 768 KB 
#include <bits/stdc++.h>
using namespace std;
#include "ricehub.h"
typedef long long ll;
priority_queue<int,vector<int>, greater<int> > pq;

int besthub(int R, int L, int X[],ll B){
    ll n = R, ans = -1, act, sum;
    for(ll i = 1; i < L; i++){
        for(ll j = 0; j < n; j++){
            pq.push(abs(i - X[j]));
        }
        sum = act = 0;
        while(!pq.empty()){
            if(sum + pq.top() > B){
                pq.pop();
                continue;
            }else{
                sum += pq.top();
                act++;
            }
            pq.pop();
        }
        ans = max(ans,act);
    }
    return ans;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Correct 3 ms 256 KB Output is correct
7 Correct 4 ms 256 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 4 ms 256 KB Output is correct
16 Correct 4 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 4 ms 256 KB Output is correct
20 Correct 5 ms 256 KB Output is correct
21 Correct 24 ms 376 KB Output is correct
22 Correct 23 ms 384 KB Output is correct
23 Correct 269 ms 384 KB Output is correct
24 Correct 259 ms 376 KB Output is correct
25 Correct 264 ms 372 KB Output is correct
26 Correct 267 ms 376 KB Output is correct
27 Correct 243 ms 376 KB Output is correct
28 Correct 242 ms 376 KB Output is correct

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 376 KB Output is correct
2 Correct 56 ms 376 KB Output is correct
3 Execution timed out 1065 ms 384 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 1068 ms 768 KB Time limit exceeded
2 Halted 0 ms 0 KB -