oj.uz

Submission #698834

# Submission time Handle Problem Language Result Execution time Memory
698834 2023-02-14T11:37:28 Z finn__ Rice Hub (IOI11_ricehub) C++17
0 / 100
 3 ms 468 KB 
#include "ricehub.h"

#define max(x, y) ((x) > (y) ? (x) : (y))

int besthub(int R, int L, int X[], long long B)
{
    int *mid = X, *begin = X, *end = X, left = 1, right = 0, max_rice = 0;
    long long cost = 0;

    while (mid < X + R)
    {
        // If the cost on the right are too high to restore balance, move the
        // left pointer first.
        if (end != X + R && cost + *end - *mid > B)
            cost -= *mid - *begin, left--;
        while (end != X + R && right <= left && cost + *end - *mid <= B)
            cost += *end - *mid, right++, end++;
        max_rice = max(max_rice, left + right);
        mid++;
    }

    return max_rice;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 288 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 468 KB Output isn't correct
2 Halted 0 ms 0 KB -