제출 #201233

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
201233		DavidDamian	쌀 창고 (IOI11_ricehub)	C++11	100 / 100	24 ms	760 KiB

ricehub

#include "ricehub.h"
#include<bits/stdc++.h>
///Median
///Sliding window
///Determine the maximum number of reachable rice fields
using namespace std;
typedef long long ll;
#define debug(x) cout<<#x<<" = "<<x<<endl
int besthub(int N, int L, int X[], ll B)
{
    ll cost=0;
    int a=0,b=0;
    int maximum=0;
    while(b<N){
        int mid;
        if(cost<=B){
            maximum=max(maximum,b-a+1);
            b++;
            mid=(a+b)/2;
            if(b<N)
                cost+=X[b]-X[mid];
        }
        else{
            a++;
            mid=(a+b)/2;
            cost-=X[mid]-X[a-1];
        }
    }
    return maximum;
}

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