제출 #885820

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

ricehub

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

#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

int besthub(int R, int L, int v[], ll B) {
    int ans = 0;

    if(R <= 5000) {
        for(int pos=0; pos<R; pos++) {
            int res = 0;
            vector<int> dist(R);
            for(int i=0; i<R; i++)
                dist[i] = abs(v[pos] - v[i]);
            sort(all(dist));
            ll x = B;
            for(int i=0; i<R; i++) {
                if(x >= dist[i]) {
                    res++;
                    x -= dist[i];
                } else break;
            }
            ans = max(ans, res);
        }
    }

    return ans;
}

// int32_t main() {
//     setIO();

//     int R, L;
//     ll B;
//     cin >> R >> L >> B;

//     int v[R];
//     for(int i=0; i<R; i++) cin >> v[i];

//     cout << besthub(R, L, v, B) << '\n';
//     return 0;
// }

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