oj.uz

Submission #584649

# Submission time Handle Problem Language Result Execution time Memory
584649 2022-06-27T18:28:45 Z Kanaifu Rice Hub (IOI11_ricehub) C++14
0 / 100
 2 ms 1108 KB 
#include <bits/stdc++.h>
#include "ricehub.h"

using namespace std;

int besthub(int R, int L, int X[], long long B)
{
    long long prefix[100001];
    prefix[0] = X[0];
    for (int i=1; i<R; i++)
    {
        prefix[i] = prefix[i-1] + (long long)(X[i]);
    }
    long long cost = 0;
    int leng = 0;
    int l = 0, r = 0;
    while (r < R)
    {
        int med = (l+r)/2;
        cost = ((long long)X[med])*((long long)(l-med))-prefix[med-1];
        cost += prefix[r] - prefix[med] - ((long long)(r-med))*((long long)X[med]);
        if (cost <= B)
        {
            leng = max(leng, r - l + 1);
            r++;
        }
        else
        {
            l++;
            r++;
        }
    }
    return leng;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 980 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 980 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

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