제출 #1184961

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1184961		swishy123	Rice Hub (IOI11_ricehub)	C++20	100 / 100	193 ms	15688 KiB

ricehub

#include <iostream>
#include <algorithm>
#include <vector>
#include <random>
#include <chrono>
#include <set>
#include <map>
#include <stack>
#include <functional>
#include <iomanip>
#include <queue>
#include <cassert>
#include <complex>
#include <cstring>
#include <memory>
#include <bitset>
#include <sstream>
#include <cmath>
#include <numeric>
#include <numbers>
#include <fstream>
#include "ricehub.h"

using namespace std;

#ifndef template
#ifndef define
 
#define ll long long
#define ld long double
#define pl pair<ll, ll>
#define pi pair<int, int>
#define nl cout << '\n';
#define x first
#define y second 
#define cbit(x) __builtin_popcountll(x)
#define uid(a, b) uniform_int_distribution<ll>(a, b)(rng) 
#define siz(x) (int)x.size()
 
#endif
 
#ifndef print
void print(size_t x) {cout << x << ' ';}
void print(int x) {cout << x << ' ';}
void print(long long x) {cout << x << ' ';}
void print(float x) {cout << x << ' ';}
void print(long double x) {cout << x << ' ';}
void print(char x) {cout << x << ' ';}
void print(const char* x) {cout << x << ' ';}
void print(bool x) {cout << x << ' ';}
void print(string &x) {cout << x << ' ';}
 
template<typename T, typename V>
void print(pair<T, V> &p) {print(p.x); print(p.y);}
template<typename T>
void print(vector<T> v) {for (int i = 0; i < v.size(); i++) print(v[i]);}
template<typename T>
void print(vector<vector<T>> v) {
    for (int i = 0; i < v.size(); i++){
        for (int j = 0; j < v[i].size(); j++)
            print(v[i][j]);
        nl;
    }
}
template <typename T, typename... V>
void print(T t, V&&... v) {print(t); print(v...);}
 
#endif
 
#ifndef read
void read(int &x) {cin >> x;}
void read(long long &x) {cin >> x;}
void read(unsigned &x) {cin >> x;}
void read(unsigned long long &x) {cin >> x;}
void read(float &x) {cin >> x;}
void read(long double &x) {cin >> x;}
void read(char &x) {cin >> x;}
void read(string &x) {cin >> x;}
void read(bool &x) {cin >> x;}
 
template<typename T> 
void read(vector<T> &v) {
    for (int i = 0; i < v.size(); i++)
        read(v[i]);
}
template <typename T, typename... V>
void read(T &t, V&... v) {read(t); read(v...);}
#endif
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> bool maxi(T& a, const T& b) {
    return a < b ? a = b, 1 : 0;
}
template<class T> bool mini(T& a, const T& b) {
    return a > b ? a = b, 1 : 0;
}
template<class... Args>
auto vec(size_t n, Args&&... args) {
    if constexpr(sizeof...(args) == 1)
        return vector(n, args...);
    else
        return vector(n, vec(args...));
}

#endif

using namespace std;
const ll inf = 1e18;
const ll def = 1e5+1;
const ll mod = 1e9;

int besthub(int R, int L, int X[], long long B){
    auto pref = vec(R + 1, 0ll);
    for (int i = 1; i <= R; i++)
        pref[i] = pref[i - 1] + X[i - 1];

    map<int, int> mp;
    for (int i = 0; i < R; i++)
        mp[X[i]]++;

    int res = 1;
    for (int i = 0; i < R; i++){
        int l = 0, r = L, mid = (l + r) / 2;
        while (l < r){
            int posL = lower_bound(X, X + R, X[i] - mid) - X;
            int posR = upper_bound(X, X + R, X[i] + mid) - X - 1; 

            ll cost = (pref[posR + 1] - pref[i]) - (ll)X[i] * (ll)(posR - i + 1) + (ll)X[i] * (ll)(i - posL) - (pref[i] - pref[posL]);
            if (cost <= B)
                l = mid;
            else    
                r = mid - 1;
            mid = (l + r) / 2;
            mid += (l + r) & 1;
        }

        int posL = lower_bound(X, X + R, X[i] - l) - X;
        int posR = upper_bound(X, X + R, X[i] + l) - X - 1; 
        ll cost = (pref[posR + 1] - pref[i]) - (ll)X[i] * (ll)(posR - i + 1) + (ll)X[i] * (ll)(i - posL) - (pref[i] - pref[posL]);
        int left = mp[X[i] + l + 1] + mp[X[i] - l - 1];
        int ligma = (B - cost) / (l + 1);
        int total = (posR - posL + 1) + min(left, ligma);

        maxi(res, total);
    }
    return res;
}

// void solve(){  
//     int r, l, b;
//     read(r, l, b);

//     int x[r];
//     for (int i = 0; i < r; i++)
//         read(x[i]);
//     print(besthub(r, l, x, b));
// }       

// /*
// 1 2 3 4 
// 2 3 4 1 
// */

// int32_t main(){
//     ios_base::sync_with_stdio(0);
//     cin.tie(0); cout.tie(0);

//     // if (ifstream("input.txt").good()){
//     //     freopen("input.txt", "r", stdin);
//     //     freopen("output.txt", "w", stdout);
//     // }

//     int t;  
//     t = 1;

//     while (t--){
//         solve();
//         nl;
//     }
// }

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