Submission #398608

#	Time	Username	Problem	Language	Result	Execution time	Memory
398608		AugustinasJucas	Rice Hub (IOI11_ricehub)	C++14	68 / 100	1087 ms	119396 KiB

ricehub

#include "ricehub.h"
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
int n, l;
const int dydis = 1e5 + 10;
long long pref[dydis];
long long sm(int l, int r){
    if(l > r) return 0;
    return pref[r] - (l == 0 ? 0ll : pref[l-1]);
}
unordered_map<int, int> kek;
pair<long long, long long> f(int dst, int ind, int mas[], long long B){
    int l = 0; int r = ind; int mid;
    int L = ind+1; int R = ind-1;
    while(l <= r){
        mid = (l + r) / 2;
        if(abs(mas[mid]-mas[ind]) < dst){
            L = min(L, mid);
            r = mid-1;
        }else{
            l = mid+1;
        }
    }
    l = ind; r = n-1;
    while(l <= r){
        mid = (l + r) / 2;
        if(abs(mas[mid] - mas[ind]) < dst){
            R = max(R, mid);
            l = mid+1;
        }else{
            r = mid-1;
        }
    }

    long long SL = 1ll * (ind - L + 1) * mas[ind] - sm(L, ind);
    long long SR = sm(ind, R) - 1ll * (R - ind + 1) * mas[ind];

    long long lieka = B - SL - SR;
    int pl = 0;
    if(lieka > 0){
        int galiu = lieka / dst;
        galiu = min(galiu, kek[mas[ind] + dst] + kek[mas[ind] - dst]);
        pl = galiu;
    }

  // cout << "SR = " << sm(ind, R) << " - " << 1ll * (R - ind + 1) * mas[ind] << ", MAS[" << ind << "] = " << mas[ind] << "    ";
  //  cout << "dst = " << dst << ", o i = " << ind << ", tai L = " << L << ", R = " <<  R << ", tai ret = " << SL << " + " << SR << endl;
    return make_pair(SL + SR, max(R - L + 1, 0)+pl);
}
int besthub(int N, int L, int X[], long long B) {
    n = N; l = L;
    for(int i = 0; i < n; i++) kek[X[i]]++;
    for(int i = 0; i < n; i++) pref[i] = 1ll * X[i] + (i == 0 ? 0ll : pref[i-1]);
    long long ans = 0;
    for(int i = 0; i < n; i++){
        long long st = 1;
        int l = 0, r = 1e9, mid;
        while(l <= r){
            mid = (l + r) / 2;
            auto ff = f(mid, i, X, B);
            if(ff.first <= B){
                st = max(st, ff.second);
                l = mid+1;
            }else{
                r = mid-1;
            }
        }
       // cout << "i = " << i << ", st = " << st << endl;
        ans = max(ans, st);
    }
    return ans;
}

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