oj.uz

Submission #486216

# Submission time Handle Problem Language Result Execution time Memory
486216 2021-11-11T01:54:07 Z Jomnoi Rice Hub (IOI11_ricehub) C++17
68 / 100
 423 ms 2172 KB 
#include <bits/stdc++.h>
#include <ricehub.h>
#define DEBUG 0
using namespace std;
 
int cost(int n, int X[], int mid, long long B) {
    deque <int> L, R;
    for(int i = 0; i < n; i++) {
        if(X[i] <= mid) {
            L.push_front(mid - X[i]);
        }
        else {
            R.push_back(X[i] - mid);
        }
    }
    int i = 0, j = 0;
    long long sum = 0;
    while(i < L.size() && j < R.size()) {
        if(L[i] <= R[j]) {
            sum += L[i++];
        }
        else {
            sum += R[j++];
        }
        if(sum > B) {
            return i + j - 1;
        }
    }
    while(i < L.size()) {
        sum += L[i++];
        if(sum > B) {
            return i + j - 1;
        }
    }
    while(j < R.size()) {
        sum += R[j++];
        if(sum > B) {
            return i + j - 1;
        }
    }
    return n;
}
 
int besthub(int R, int L, int X[], long long B) {
    int l = 1, r = L, ans = 0, mid, cost1;
    int l2, r2, mid2, pos2, cost2;
    while(l <= r) {
        mid = (l + r) / 2;
        cost1 = cost(R, X, mid, B);
        l2 = l + 1, r2 = r, pos2 = r;
        while(l2 <= r2) {
            mid2 = (l2 + r2) / 2;
            if(cost1 == cost(R, X, mid2, B)) {
                l2 = mid2 + 1;
            }
            else {
                r2 = mid2 - 1;
                pos2 = min(pos2, mid2);
            }
        }
        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;
}

Compilation message

ricehub.cpp: In function 'int cost(int, int*, int, long long int)':
ricehub.cpp:18:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |     while(i < L.size() && j < R.size()) {
      |           ~~^~~~~~~~~~
ricehub.cpp:18:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |     while(i < L.size() && j < R.size()) {
      |                           ~~^~~~~~~~~~
ricehub.cpp:29:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |     while(i < L.size()) {
      |           ~~^~~~~~~~~~
ricehub.cpp:35:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |     while(j < R.size()) {
      |           ~~^~~~~~~~~~

Subtask #1
17.0 / 17.0

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

Subtask #2
25.0 / 25.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 0 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 0 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 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 280 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 308 KB Output is correct
27 Correct 1 ms 304 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 204 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 204 KB Output is correct
9 Correct 1 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 2 ms 204 KB Output is correct
19 Correct 2 ms 204 KB Output is correct
20 Correct 4 ms 204 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 4 ms 332 KB Output is correct
24 Correct 6 ms 380 KB Output is correct
25 Correct 18 ms 332 KB Output is correct
26 Correct 18 ms 364 KB Output is correct
27 Correct 8 ms 332 KB Output is correct
28 Correct 8 ms 388 KB Output is correct

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 588 KB Output is correct
2 Correct 14 ms 588 KB Output is correct
3 Correct 290 ms 2156 KB Output is correct
4 Correct 423 ms 2172 KB Output is correct
5 Incorrect 32 ms 972 KB Output isn't correct
6 Halted 0 ms 0 KB -