oj.uz

Submission #422232

# Submission time Handle Problem Language Result Execution time Memory
422232 2021-06-09T22:34:42 Z ScarletS Rice Hub (IOI11_ricehub) C++17
0 / 100
 4 ms 460 KB 
#include <bits/stdc++.h>
using namespace std;

int besthub(int R, int L, int a[], long long B)
{
    int l=0,r=R,m,x,y;
    bool ok;
    long long cur;
    while (l<r)
    {
        ok=0;
        m=l+(r-l)/2+1;
        cur=0;
        x=0;y=m-1;
        for (int i=0;i<=y/2;++i)
            cur-=a[i];
        for (int i=y/2+1;i<m;++i)
            cur+=a[i];
        if (cur+1LL*a[(x+y)/2]*((m-1)/2+1)-1LL*a[(x+y)/2]*(m-(m-1)/2)<=B)
            ok=1;
        for (;y<R;++x,++y)
        {
            cur+=a[x-1];
            cur+=a[y];
            cur-=a[(x+y)/2]*2;
            if (cur+1LL*a[(x+y)/2]*((m-1)/2+1)-1LL*a[(x+y)/2]*(m-(m-1)/2)<=B)
                ok=1;
        }
        if (ok)
            l=m;
        else
            r=m-1;
    }
    return l;
}

Subtask #1
0 / 17.0

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

Subtask #2
0 / 25.0

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