Submission #201192

#	Time	Username	Problem	Language	Result	Execution time	Memory
201192		DavidDamian	쌀 창고 (IOI11_ricehub)	C++11	0 / 100	1079 ms	504 KiB

ricehub

#include "ricehub.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int besthub(int N, int L, int X[], ll B)
{
    int maximum=0;
    for(int i=1;i<=L;i++){
        ll money=B;
        int total=0;
        for(int j=0;j<N;j++){
            if(money>=abs(i-X[j])){
                money-=abs(i-X[j]);
                total++;
            }
        }
        maximum=max(maximum,total);
    }
    return maximum;
}

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