Submission #639747

#	Time	Username	Problem	Language	Result	Execution time	Memory
639747		bonk	Rice Hub (IOI11_ricehub)	C++14	0 / 100	1075 ms	524 KiB

ricehub

#include <bits/stdc++.h>
#include <ricehub.h>

using namespace std;
using ll = long long;

int besthub(int r, int l, int x[], ll b){
    ll ans = 0;

    for(int i = 1; i <= l; i++){
        priority_queue<ll>pq;
        ll cost = 0;
        ll tmp = 0;
        for(int j = 0; j < r; j++){
            ll a = abs(x[j] - i);
            if(cost + a <= b){
                pq.push(a);
                cost += a;
                tmp++;
            } else if(!pq.empty() && pq.top() > a){
                cost -= pq.top();
                cost += a;
                pq.push(a);
            }
        }

        ans = max(ans, tmp);
    }

    return ans;
}

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