제출 #29507

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
29507		inqr	쌀 창고 (IOI11_ricehub)	C++14	68 / 100	39 ms	6316 KiB

ricehub

#include "ricehub.h"
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define rt insert
#define st first
#define nd second
using namespace std;
vector < int > presum;
int fienum,ans;
long long b;
long long sum(int l,int r){
    if(l==0)return presum[r];
    else return presum[r]-presum[l-1];
}
long long comp(int l,int r,int X[]){
    long long m=(l+r)/2;
    long long lc=m-l,rc=r-m;
    return lc*X[m]-sum(l,m-1)+sum(m+1,r)-rc*X[m];
}
void solve(int s,int X[]){
    int l=s,r=fienum-1;
    while(l<=r){
        int m=(l+r)/2;
        //printf("s=%d l=%d r=%d m=%d comp=%d %d\n",s,l,r,m,comp(s,m,X).st,comp(s,m,X).nd);
        if(comp(s,m,X)<=b){
            l=m+1;
            ans=max(ans,m-s+1);
        }
        else r=m-1;
    }
}
int besthub(int R, int L, int X[], long long B)
{
    fienum=R;b=B;
    presum.resize(R);
    presum[0]=X[0];
    for(int i=1;i<R;i++)presum[i]=presum[i-1]+X[i];
    for(int i=0;i<R;i++){
        solve(i,X);
    }
    return ans;
}

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