oj.uz

Submission #60668

# Submission time Handle Problem Language Result Execution time Memory
60668 2018-07-24T13:58:16 Z theknife2001 Rice Hub (IOI11_ricehub) C++17
0 / 100
 1000 ms 884 KB 
#include "ricehub.h"
#include <bits/stdc++.h>

using namespace std;
const int N=1e5+55;
long long sum[N];
int pos[N];
int n;


bool ok(int x, int b)
{
    int temp;
    int best,cur;
    best=1e9+55;
    for(int i=0;i<n-x;i++)
    {
        cur=0;
        if(i)
            temp=(sum[i+x-1]-sum[i-1])/x;
        else
            temp=sum[i+x-1];
        for(int j=i;j<=i+x;j++)
        {
            cur+=abs(pos[i]-temp);
        }
        best=min(best,cur);
        cur=0;
        for(int j=i;j<=i+x;j++)
        {
            cur+=abs(pos[i]-temp-1);
        }
        best=min(best,cur);
    }
    if(best>b)
        return 0;
    return 1;
}

int besthub(int N, int L, int X[], long long B)
{
    n=N;
    for(int i=0;i<n;i++)
    {
        pos[i]=X[i];
        sum[i]=X[i];
        if(i)
            sum[i]+=sum[i-1];
    }
    int l=0;
    int r=n;
    int mid;
    while(l<r)
    {
        mid=(l+r)/2;
        if(ok(mid,B))
            l=mid;
        else
            r=mid-1;
    }
    return l;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1081 ms 376 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1070 ms 376 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1054 ms 448 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

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