oj.uz

Submission #715572

# Submission time Handle Problem Language Result Execution time Memory
715572 2023-03-27T08:37:49 Z cbup Rice Hub (IOI11_ricehub) C++14
0 / 100
 4 ms 468 KB 
#include<bits/stdc++.h>
using namespace std;

long long besthub(int n,int l,int x[],long long b){
    long long cost,ans=1;
    int mid,en,low=0,high=n-1,m,check = 0;
    vector<long long> prefixSum(n+1,0);

    for(int i=1;i<=n;i++)prefixSum[i] = prefixSum[i-1]+x[i-1];
    //for(int i=1;i<=n;i++)cout<<prefixSum[i]<<" "; cout<<endl;
    while(low<=high){
        m = (low+high)/2;
        for(int st=0;st<n-m;st++){
            en = st+m;
            mid = (st+en)/2;
            cost = (mid-st)*x[mid]*1LL-(prefixSum[mid]-prefixSum[st]) + (prefixSum[en+1]-prefixSum[mid+1])-(en-mid)*x[mid]*1LL;

            if(cost <= b){
                ans = max(ans,en-st+1LL);
                check = 1;
            }
            //cout<<st<<" "<<en<<" "<<cost<<endl;
        }

        if(check)high = m-1;
        else low = m+1;
    }

    return ans;
}

Subtask #1
0 / 17.0

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

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

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