oj.uz

Submission #411188

# Submission time Handle Problem Language Result Execution time Memory
411188 2021-05-24T14:33:52 Z LouayFarah Rice Hub (IOI11_ricehub) C++14
0 / 100
 490 ms 356 KB 
#include "bits/stdc++.h"
#include "ricehub.h"
using namespace std;

long long S(int X[], int h, int l, int r)
{
    long long sum = 0;
    for(int i = l; i<=r; i++)
        sum = sum + abs(h-X[l]);
    return sum;
}

int besthub(int R, int L, int X[], long long B)
{
    int res = 0;

    for(int l = 0; l<R; l++)
    {
        for(int r = l; r<R; r++)
        {
            int h = X[(l+r)/2];
            long long curr = S(X, h, l, r);
            if(curr <=B)
                res = max(res, r-l+1);
        }
    }
    return res-1;
}

Subtask #1
0 / 17.0

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

Subtask #2
0 / 25.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 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

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