제출 #763366

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
763366		boris_mihov	Rice Hub (IOI11_ricehub)	C++17	100 / 100	11 ms	2900 KiB

ricehub

#include "ricehub.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>

typedef long long llong;
const int MAXN = 100000 + 10;
const int INF  = 1e9;

int n;
llong b;
int a[MAXN];
llong prefix[MAXN];

bool check(int needed)
{
    for (int i = 1 ; i + needed - 1 <= n ; ++i)
    {
        llong currCost = 0;
        int med = (i + i + needed - 1) / 2;
        currCost += 1LL * (med - i + 1) * a[med] - (prefix[med] - prefix[i - 1]);
        currCost += (prefix[i + needed - 1] - prefix[med]) - 1LL * (i + needed - 1 - med) * a[med];
        if (currCost <= b) return true;
    }

    return false;
}

int besthub(int N, int L, int X[], long long B)
{
    n = N;
    for (int i = 0 ; i < n ; ++i)
    {
        a[i + 1] = X[i];
        prefix[i + 1] = prefix[i] + X[i];
    }

    b = B;
    int l = 0, r = n + 1, mid;
    while (l < r - 1)
    {
        mid = (l + r) / 2;
        if (check(mid)) l = mid;
        else r = mid;
    }

    return l;
}

• Subtask 1: 17 / 17
• Subtask 2: 25 / 25
• Subtask 3: 26 / 26
• Subtask 4: 32 / 32