oj.uz

Submission #486139

# Submission time Handle Problem Language Result Execution time Memory
486139 2021-11-10T15:35:29 Z Jomnoi Rice Hub (IOI11_ricehub) C++17
68 / 100
 163 ms 928 KB 
#include <bits/stdc++.h>
#include <ricehub.h>
#define DEBUG 0
using namespace std;

int cost(int R, int X[], int mid, long long B) {
    long long closest = 1e18;
    int pos;
    for(int i = 0; i < R; i++) {
        if(abs(X[i] - mid) < closest) {
            closest = abs(X[i] - mid);
            pos = i;
        }
    }
    int l = pos, r = pos;
    if(!pos) {
        r++;
    }
    else {
        l--;
    }
    long long sum = 0;
    int ct = 0;
    while(1) {
        closest = 1e18;
        int ok = -1;
        if(l >= 0 && closest > abs(X[l] - mid)) {
            closest = abs(X[l] - mid);
            ok = 0;
        }
        if(r < R && closest > abs(X[r] - mid)) {
            closest = abs(X[r] - mid);
            ok = 1;
        }
        if(sum + closest > B) {
            return ct;
        }
        ct++;
        sum += closest;
        if(!ok) {
            l--;
        }
        else {
            r++;
        }
    }
    return R;
}

int besthub(int R, int L, int X[], long long B) {
    int l = 1, r = L, ans = 0;
    while(l <= r) {
        int mid = (l + r) / 2;
        int cost1 = cost(R, X, mid, B);
        int l2 = l + 1, r2 = r, pos2 = r;
        while(l2 <= r2) {
            int mid2 = (l2 + r2) / 2;
            int cost2 = cost(R, X, mid2, B);
            if(cost1 == cost2) {
                l2 = mid2 + 1;
            }
            else {
                r2 = mid2 - 1;
                pos2 = min(pos2, mid2);
            }
        }
        int cost2 = cost(R, X, pos2, B);
        if(cost1 > cost2) {
            r = mid - 1;
            ans = max(ans, cost1);
        }
        else {
            l = mid + 1;
            ans = max(ans, cost2);
        }
    }
    return ans;
}
 
// int main() {
//     ios_base::sync_with_stdio(0);
//     cin.tie(0);
//     int r, l, b;
//     cin >> r >> l >> b;
//     int x[l];
//     for(int i = 0; i < r; i++) {
//         cin >> x[i];
//     }
//     cout << besthub(r, l, x, b);
//     return 0;
// }
 
/*
5 20 6
1 2 10 12 14
*/

Compilation message

ricehub.cpp: In function 'int cost(int, int*, int, long long int)':
ricehub.cpp:20:10: warning: 'pos' may be used uninitialized in this function [-Wmaybe-uninitialized]
   20 |         l--;
      |         ~^~

Subtask #1
17.0 / 17.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 308 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 2 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 2 ms 204 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 2 ms 332 KB Output is correct
24 Correct 3 ms 316 KB Output is correct
25 Correct 10 ms 372 KB Output is correct
26 Correct 11 ms 332 KB Output is correct
27 Correct 5 ms 312 KB Output is correct
28 Correct 4 ms 332 KB Output is correct

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 332 KB Output is correct
2 Correct 5 ms 332 KB Output is correct
3 Correct 127 ms 928 KB Output is correct
4 Correct 163 ms 824 KB Output is correct
5 Incorrect 14 ms 756 KB Output isn't correct
6 Halted 0 ms 0 KB -