oj.uz

Submission #876812

# Submission time Handle Problem Language Result Execution time Memory
876812 2023-11-22T11:27:29 Z JakobZorz Rice Hub (IOI11_ricehub) C++14
0 / 100
 2 ms 2652 KB 
#include "ricehub.h"
typedef long long ll;

int n;
int arr[100000];
ll ps[100001];
ll sum;

bool is_possible(int num){
    int num1=num/2;
    int num2=(num+1)/2;
    
    for(int i=num1;i<=n-num1;i++){
        if(num1*arr[i]-(ps[i]-ps[i-num1])-num2*arr[i]+(ps[i+num2]-ps[i])<=sum)
            return true;
    }
    return false;
}

int besthub(int R,int L,int X[],ll B){
    sum=B;
    n=R;
    for(int i=0;i<n;i++)
        arr[i]=X[i];
    for(int i=0;i<n;i++)
        ps[i+1]=ps[i]+arr[i];
    
    int l=1,r=100001;
    while(l<r-1){
        int m=(l+r)/2;
        if(is_possible(m))
            l=m;
        else
            r=m;
    }
    
    return l;
}

Subtask #1
0 / 17.0

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