Submission #201219

#	Time	Username	Problem	Language	Result	Execution time	Memory
201219		DavidDamian	Rice Hub (IOI11_ricehub)	C++11	42 / 100	1093 ms	632 KiB

ricehub

#include "ricehub.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
struct field
{
    int x,dist;
};
bool byDistance(field a,field b)
{
    return a.dist<b.dist;
}
int besthub(int N, int L, int X[], ll B)
{
    vector<field> A(N);
    for(int i=0;i<N;i++){
        A[i].x=X[i];
    }
    int maximum=0;
    for(int k=0;k<N;k++){
        for(int i=0;i<N;i++){
            A[i].dist=abs(A[i].x-X[k]);
        }
        sort(A.begin(),A.end(),byDistance);
        ll cost=0;
        int total=0;
        for(int i=0;i<N;i++){
            if(cost+(ll)abs(A[i].dist)>B) break;
            cost+=(ll)abs(A[i].dist);
            total++;
        }
        maximum=max(maximum,total);
    }
    return maximum;
}

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