Submission #880726

#	Time	Username	Problem	Language	Result	Execution time	Memory
880726		andro	Rice Hub (IOI11_ricehub)	C++14	100 / 100	10 ms	3676 KiB

ricehub

#include<bits/stdc++.h>
#include "ricehub.h"
 
using namespace std;
using ll = long long;
 
const int N = 100005;
ll suf[N], pref[N];
 
int besthub(int n, int L, int a[], long long c)
{
    if(n==1)return 1;
    for(int i=1; i<=n; i++){
        pref[i]=pref[i-1]+a[i-1];
    }
    for(int i=n-1; i>=0; i--){
        suf[i]=pref[n]-pref[i];
    }
    ll sufind=n;
    ll mx;
    ll s=n/2;
    ll cost=2e18;
    while(cost>c){
        s=sufind/2;
        cost=a[s]*(s+1)-pref[s+1]-a[s]*(sufind-s)+suf[s]-suf[sufind];
        if(cost<=c)break;
        sufind--;
 
    }
    mx=sufind;
    for(int i=1; i< n; i++){
        cost=0;
        while(cost<=c && sufind<n){
            s=(sufind+i)/2;
            cost=a[s]*(s-i+1)-pref[s+1]+pref[i]-a[s]*(sufind-s)+suf[s+1]-suf[sufind+1];
            sufind++;
        }
        if(sufind==n && cost<=c){
            mx=max(mx, sufind-i);
            break;
        }
        else{
            sufind--;
            mx=max(mx, sufind-i);
        }
    }
    return mx;
}

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