oj.uz

Submission #1003330

# Submission time Handle Problem Language Result Execution time Memory
1003330 2024-06-20T09:00:21 Z hacizadal Rice Hub (IOI11_ricehub) C++17
42 / 100
 1000 ms 1084 KB 
#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define pll pair<ll, ll>

int besthub(int n, int l, int a[], long long b)
{
    ll mx = 0;
    for (ll i = 0; i<n; i++){
        priority_queue<ll, vector<ll>, greater<ll>>pq;
        for (ll j = 0; j<n; j++){
            pq.push(abs(a[j] - a[i]));
        }
        ll sum = 0, cnt = 0;
        while (pq.size()){
            ll x = pq.top();
            pq.pop();
            sum += x;
            cnt++;
            if (sum > b){
                sum -= x;
                cnt--;
                break;
            }
        }
        mx = max(mx, cnt);
    }
    return mx;
}

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 1 ms 444 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 444 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 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 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 8 ms 456 KB Output is correct
24 Correct 8 ms 344 KB Output is correct
25 Correct 8 ms 348 KB Output is correct
26 Correct 8 ms 344 KB Output is correct
27 Correct 8 ms 348 KB Output is correct
28 Correct 5 ms 348 KB Output is correct

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 48 ms 348 KB Output is correct
4 Correct 42 ms 468 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 6 ms 348 KB Output is correct
8 Correct 6 ms 348 KB Output is correct
9 Correct 3 ms 456 KB Output is correct
10 Correct 5 ms 348 KB Output is correct
11 Correct 7 ms 476 KB Output is correct
12 Correct 7 ms 472 KB Output is correct
13 Correct 37 ms 472 KB Output is correct
14 Correct 40 ms 348 KB Output is correct
15 Correct 5 ms 348 KB Output is correct
16 Correct 8 ms 348 KB Output is correct
17 Correct 28 ms 348 KB Output is correct
18 Correct 36 ms 344 KB Output is correct
19 Correct 42 ms 348 KB Output is correct
20 Correct 43 ms 348 KB Output is correct
21 Correct 258 ms 472 KB Output is correct
22 Correct 255 ms 568 KB Output is correct
23 Execution timed out 1062 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 1054 ms 1084 KB Time limit exceeded
2 Halted 0 ms 0 KB -