oj.uz

Submission #639752

# Submission time Handle Problem Language Result Execution time Memory
639752 2022-09-11T13:31:22 Z bonk Rice Hub (IOI11_ricehub) C++14
42 / 100
 1000 ms 468 KB 
#include <bits/stdc++.h>
#include <ricehub.h>

using namespace std;
using ll = long long;

int besthub(int r, int l, int x[], ll b){
    ll ans = 0;

    for(int i = 1; i <= l; i++){
        priority_queue<ll>pq;
        ll cost = 0;
        ll tmp = 0;
        for(int j = 0; j < r; j++){
            ll a = abs(x[j] - i);
            if(cost + a <= b){
                pq.push(a);
                cost += a;
                tmp++;
            } else if(!pq.empty() && pq.top() > a){
                cost -= pq.top(); pq.pop();
                cost += a;
                pq.push(a);
            }
        }

        ans = max(ans, tmp);
    }

    return ans;
}

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 0 ms 212 KB Output is correct
4 Correct 0 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 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
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 2 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 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 2 ms 296 KB Output is correct
16 Correct 2 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 2 ms 212 KB Output is correct
20 Correct 2 ms 212 KB Output is correct
21 Correct 3 ms 212 KB Output is correct
22 Correct 4 ms 212 KB Output is correct
23 Correct 57 ms 212 KB Output is correct
24 Correct 56 ms 212 KB Output is correct
25 Correct 55 ms 212 KB Output is correct
26 Correct 55 ms 212 KB Output is correct
27 Correct 74 ms 212 KB Output is correct
28 Correct 75 ms 212 KB Output is correct

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 312 KB Output is correct
2 Correct 11 ms 212 KB Output is correct
3 Execution timed out 1084 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 1065 ms 468 KB Time limit exceeded
2 Halted 0 ms 0 KB -